Sciweavers

PODS
2006
ACM
217views Database» more  PODS 2006»
15 years 9 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
PODS
2006
ACM
216views Database» more  PODS 2006»
15 years 9 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
PODS
2006
ACM
208views Database» more  PODS 2006»
15 years 9 months ago
An adaptive packed-memory array
Michael A. Bender, Haodong Hu
PODS
2006
ACM
196views Database» more  PODS 2006»
15 years 9 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
PODS
2006
ACM
186views Database» more  PODS 2006»
15 years 9 months ago
Flow algorithms for two pipelined filter ordering problems
Anne Condon, Amol Deshpande, Lisa Hellerstein, Nin...
Database
Top of PageReset Settings