PODS 2006 - PDF Preprint Papers

PODS 2006 Symposium on Principles of Database Systems

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed PODS-2006 Paper

click to vote

PODS
2006
ACM

217views Database» more PODS 2006»

A simpler and more efficient deterministic scheme for finding frequent items over sliding windows

14 years 4 months ago

Download i.cs.hku.hk

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

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	217	A simpler and more efficient deterministic scheme for finding frequent items over sliding windows	claim
2	216	Cache-oblivious string B-trees	claim
3	208	An adaptive packed-memory array	claim
4	196	The containment problem for REAL conjunctive queries with inequalities	claim
5	186	Flow algorithms for two pipelined filter ordering problems	claim
6	177	Equivalence of queries combining set and bag-set semantics	claim
7	168	Counting triangles in data streams	claim
8	161	Privacy via pseudorandom sketches	claim
9	156	From statistical knowledge bases to degrees of belief: an overview	claim
10	138	Efficiently ordering subgoals with access constraints	claim
11	137	Data exchange: computing cores in polynomial time	claim
12	134	Approximate quantiles and the order of the stream	claim
13	134	Finding global icebergs over distributed data sets	claim
14	132	Principles of dataspace systems	claim
15	127	Evolution of page popularity under random web graph models	claim
16	122	Space- and time-efficient deterministic algorithms for biased quantiles over data streams	claim
17	122	Verification of communicating data-driven web services	claim
18	122	Inverting schema mappings	claim
19	121	On the efficiency of checking perfect privacy	claim
20	118	Analyzing workflows implied by instance-dependent access rules	claim
21	116	Relational lenses: a language for updatable views	claim
22	115	Scalable computation of acyclic joins	claim
23	114	On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF	claim
24	111	Finding and approximating top-k answers in keyword proximity search	claim
25	111	The expressivity of XPath with transitive closure	claim
26	108	Deterministic k-set structure	claim
27	107	Asking the right questions: model-driven optimization using probes	claim
28	107	Programmable clustering	claim
29	106	Achieving anonymity via clustering	claim
30	104	Tractable database design through bounded treewidth	claim
31	98	Two-variable logic on data trees and XML reasoning	claim
32	98	Processing queries on tree-structured data efficiently	claim
33	96	Efficient gossip-based aggregate computation	claim
34	95	Randomized computations on large data sets: tight lower bounds	claim
35	88	Structural characterizations of the semantics of XPath as navigation tool on a document	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers