The interesting fact emerges that farm workers, not properly instructed in the cleansing of covered pails, were actually getting worse results with them than with open pails :? Buckets, open and covered, were washed by the farm hands with warm water and a cloth in accordance with the usual practice. The milk taken into the covered bucket contained many more bacteria than that taken into the ope...

Hash tables are important data structures that lie at the heart of important applications such as key-value stores and relational databases. Typically bucketized cuckoo hash tables (BCHTs) are used because they provide highthroughput lookups and load factors that exceed 95%. Unfortunately, this performance comes at the cost of reduced memory access efficiency. Positive lookups (key is in the ta...

The Super Database Computer (SDC) is a highperformance relational database server for a joinintensive environment under development at University of Tokyo. SDC is designed to execute a join in a highly parallel way. Compared to other join algorithms, a hash-based algorithm is quite efficient and easily parallelieed, and has been employed by many database machines. However, in the presence of da...

The Long Range Dependence (LRD) property of actual traffic in today’s network applications has been shown to have significant impact on network performance. In this paper we consider the problem of optimally dimensioning token bucket parameters for LRD traffic. We first empirically illustrate the different behavior of token buckets when acting on LRD vs. SRD traffic with identical average and p...

in this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. we also find the expectation of the number of nodes of a given outdegree in a branch of such trees.

Query rewriting using views is an important issue in data integration. Several algorithms have been proposed, such as the bucket algorithm, the inverse rules algorithm, the SVB algorithm, and the MiniCon algorithm. These algorithms can be divided into two categories. The algorithms of the first category are based on use of buckets while the ones of the second category are based on use of invers...

Trie hashing is a scheme, proposed by Litwin, for indexing records with very long alphanumeric keys. The records are grouped into buckets of capacity b records per bucket and maintained on secondary storage. To retrieve a record, the memory resident trie is traversed from the root to a leaf node where the address of the target bucket is found. Using the address found, the data bucket is read in...

Recent technological advances in mobile devices enable the connection of classrooms with other virtual and physical spaces. Some approaches aim at helping teachers carry out learning situations across such spaces. However, these proposals tend to be isolated from other activities in teachers’ current common practices, and do not allow teacher-controlled flexibility of what students do during th...

This paper discusses the issues to consider when selecting congestion control scheme for an integrated ground radio and satellite network engaging primarily in transmitting multi-media traac, and then it proceeds to discuss eeects (both positive and negative) of smoothing rendered on the input traac as a congestion control scheme. We chose traac shaping by smoothing rendered on the input traac ...

Since MapReduce became an effective and popular programming framework for parallel data processing, key skew in intermediate data has become one of the important system performance bottlenecks. For solving the load imbalance of bucket containers in the shuffle process of the Spark computing framework, this paper proposes a splitting and combination algorithm for skew intermediate data blocks (S...