System and method for multiple distinct aggregate queries

Details System and method for multiple distinct aggregate queries System and method for multiple distinct aggregate queries

2011-08-23

2011-08-23

Ali, Mohammad (Department: 2158)

Data processing: database and file management or data structures

Database design

Data structure types

C707S602000, C711S216000, C715S213000

Reexamination Certificate

active

08005868

ABSTRACT:
There is disclosed a system and method for executing multiple distinct aggregate queries. In an embodiment, the method comprises: providing at least one Counting Bloom Filter for each distinct column of an input data stream; reviewing count values in the at least one Counting Bloom Filter for the existence of duplicates in each distinct column; and if necessary, using a distinct hash operator to remove duplicates from each distinct column of the input data stream, thereby removing the need for replicating the input data stream and minimizing distinct hash operator processing. Also, the use of Counting Bloom Filters for monitoring data streams allow an early duplicate removal of the input stream of data, resulting in savings in computation time and memory resources.

REFERENCES:
patent: 6275818 (2001-08-01), Subramanian et al.
patent: 7636703 (2009-12-01), Taylor
patent: 2004/0117356 (2004-06-01), Chen et al.
patent: 2005/0021758 (2005-01-01), White
patent: 2008/0147599 (2008-06-01), Young-Lai
patent: 2008/0313132 (2008-12-01), Hao et al.
patent: 2009/0182726 (2009-07-01), Wang
patent: 2010/0098081 (2010-04-01), Dharmapurikar et al.
Xueqing Gong, et al.; “Bloom Filter-based XML Packets Filtering for Millions of Path Queries”; http://wwwcs.uni-paderborn.de/cs/ag-boettcher/lehre/SS05/sem-ss05/iCDE2005.pdf.
P. Ferragina, et al.; “Bloom Filters and Count-Min Sketches with Some of Their Applications”; http://roguefort.di.unipi.it/˜ferrax/Teach/InformationRetrieval/BFCM.pdf.
J. Aguilar Saborit, et al.; “Dynamic Count Filters”; SIGMOD Record; http://www.sigmod.org/sigmod/record/issues/0603/p26-article-pev.pdf; Mar. 1, 2006; pp. 26-32; vol. 35, No. 1.
Ahmed Metwally, et al.; “Duplicate Detection in Click Streams”; WWW 2005; http://www2005.org/cdrom/docs/p12.pdf; May 10-14, 2005; pp. 12-21; Chiba, Japan.
Saar Cohen, et al.; “Spectral Bloom Filters”; SIGMOD 2003; http://acm.org/sigmod/sigmod03/eproceedings/papers/r09p02.pdf; Jun. 9-12, 2003; pp. 241-252; San Diego, CA.
Ryan Huebsch, et al.; “Sharing Aggregate Computation for Distributed Queries”; SIGMOD '07; http://delivery.acm.org/10.1145/1250000/1247535/p485-huebsch.pdf?key1=1247535&key2=5767967811&coll=&dl=GUIDE&CFID=15151515&CFTOKEN=6184618; Jun. 12-14, 2007; pp. 485-495; Beijing, China.

Affiliated with

Also associated with

Rating

System and method for multiple distinct aggregate queries does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for multiple distinct aggregate queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for multiple distinct aggregate queries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2730453