Linear Hashing is a dynamically updateable diskbased index structure which implements a hashing scheme and which grows or shrinks one bucket at a time. The index is used to support exact match queries, i.e., find the record with a given key. Compared with the BC-tree index which also supports exact match queries (in logarithmic number of I/Os), Linear Hashing has better expected query cost O(1)...

In this article, we describe a phenomenon we discovered while conducting experiments on walking and reaching. We asked university students to pick up either of two buckets, one to the left of an alley and one to the right, and to carry the selected bucket to the alley's end. In most trials, one of the buckets was closer to the end point. We emphasized choosing the easier task, expecting partici...

PEP-II, the asymmetric B-Factory at SLAC, has delivered a luminosity of 3.1 · 10 cm s. This was achieved with 692 bunches in a basic "by-3" bunch pattern. Many gaps in the bunch train were necessary to suppress a blow-up of the positron beam due to an electron cloud instability (ECI). The actual pattern had 10 bunches in a row (every third bucket), then 6 bunches missing. This 48-bucket long pa...

T hank you. The comments I am about to make are my own personal views. They are not the views of the National Heart, Lung, and Blood Institute or the US Department of Health and Human Services. I have no conflicts of interest to disclose. There once was a king who had 2 servants. 1 One day, he asked the servants to take buckets down to the well, which was located just outside the palace. He tol...

DEFINITION Linear Hashing is a dynamically updateable disk-based index structure which implements a hashing scheme and which grows or shrinks one bucket at a time. The index is used to support exact match queries, i.e. find the record with a given key. Compared with the B+-tree index which also supports exact match queries (in logarithmic number of I/Os), Linear Hashing has better expected quer...

A shaper is a system that stores incoming bits in a bu er and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper is time invariant if the tra c constraint is dened by a xed arrival curve; it is time varying if the condition on the output is given by a time varying tra c contract. This occurs, for example, with renegotiable variabl...

Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols. They are compact representation of data that use hash functions to randomize a set of items. Being able to store more elements while keeping a reaso...

Algorithms for answering queries using views have been used to integrate information from multiple sources. The bucket algorithm, predominantly used to reformulate queries, has two drawbacks. It generates a large number of candidate solutions, even when the number of sound solutions is small, and then checks for their soundness using an exponential conjunctive-query-containment test. Leser 1] p...

A shaper is a system that stores incoming bits in a buuer and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper is time invariant if the traac constraint is de-ned by a xed arrival curve; it is time varying if the condition on the output is given by a time varying traac contract. This occurs, for example, with renegotiable variab...

Based on a series of physical model tests and numerical simulations, the bearing characteristics tripod-bucket foundation are investigated. It is found that with decrease in aspect ratio (L/D), rotation center will decrease, displacement change from to uplift. Characteristics earth pressure buckets both finite element analysis studied, which used explain failure mechanism for foundations differ...