147
click to vote
PODS
16 years 2 months ago
2006 ACM
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 ...
119
Voted
PODS
16 years 2 months ago
2006 ACM
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...
PODS
16 years 2 months ago
2006 ACM 116
click to vote
PODS
16 years 2 months ago
2006 ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
93
Voted
PODS
16 years 2 months ago
2006 ACM |