Processing overlapping continuous queries

Details Processing overlapping continuous queries Processing overlapping continuous queries

2007-08-09

2011-11-08

Fleurantin, Jean B. (Department: 2162)

Data processing: database and file management or data structures

Database and file access

Query optimization

Reexamination Certificate

active

08055653

ABSTRACT:
An edge-covering based greedy method for shared filter ordering includes receiving a plurality of queries, wherein each query is a conjunction of filters, and each filter is shared across multiple queries of the plurality of queries, evaluating a unit price of each filter, evaluating, sequentially, each filter in order of a lowest to a highest unit price, to determine a value for each filter, and changing an ordering of the filters according to the values. An edge-covering based harmonic method for shared filter ordering includes receiving a plurality of queries, wherein each query is a conjunction of filters, and each filter is shared across multiple queries of the plurality of queries, evaluating a weight of each filter, evaluating, randomly, each filter having a probability inversely proportionally to its weight, to determine a value, and changing an ordering of the filters according to the values.

REFERENCES:
patent: 7269597 (2007-09-01), Stockfisch
patent: 2004/0133565 (2004-07-01), Hinshaw et al.
M. Aguilera, R. Strom, D. Sturman, M. Astley, and T. Chandra. Matching events in a content-based subscription system. In Proc. PODC, 1999.
M. Altinel and M. J. Franklin. E±cient—ltering of XML documents for selective dissemination of information. In Proc. VLDB, 2000.
S. Babu, R. Motwani, K. Munagala, I. Nishizawa, and J. Widom. Adaptive ordering of pipelined stream filters. In SIGMOD, pp. 407{418, New York, NY, USA, 2004. ACM Press.
C.-Y. Chan, P. Felber, M. Garofalakis, and R. Rastogi. Efficient filtering of XML documents with XPath expressions. The VLDB Journal, 11(4):354{379, 2002.
J. Chen, D. DeWitt, and J. Naughton. Design and evaluation of alternative selection placement strategies in optimizing continuous queries. In Proc. ICDE, 2002.
J. Chen, D. DeWitt, F. Tian, and Y. Wang. NiagaraCQ: A scalable continuous query system for Internet databases. In Proc. SIGMOD, 2000.
P. A. Chirita, S. Idreos, M. Koubarakis, and W. Nejdl. Publish/ subscribe for RDF-based P2P networks. In Proc. European Semantic Web Symposium, 2004.
M. Cilia, C. Bornhoevd, and A. P. Buchmann. CREAM: An infrastructure for distributed, heterogeneous event-based applications. In Proc. International Conference on Cooperative Information Systems, 2003.
A. Condon, A. Deshpande, L. Hellerstein, and N. Wu. Flow algorithms for two pipelined filter ordering problems. In PODS, pp. 193{202, New York, NY, USA, 2006. ACM Press.
G. Cugola, E. D. Nitto, and A. Fuggetta. Exploiting an event- based infrastructure to develop complex distributed systems. In Proc. ICSE, 1998.
N. Dalvi, S. Sanghai, P. Roy, and S. Sudarshan. Pipelining in multi-query optimization. In Proc. PODS, 2001.
J. Hellerstein and M. Stonebraker. Predicate migration: Optimizing queries with expensive predicates. In Proc. SIGMOD, 1993.
S. Madden, M. Shah, J. Hellerstein, and V. Raman. Continuously adaptive continuous queries over streams. In Proc. SIGMOD, 2002.
H. Mistry, P. Roy, S. Sudarshan, and K. Ramamritham. Materialized view selection and maintenance using multi-query optimization. In Proc. SIGMOD, 2001.
K. Munagala, U. Srivastava, and J. Widom. Optimization of continuous queries with shared expensive filters. To appear in Proc. PODS, 2007.
J. Pereira, F. Fabret, H.-A. Jacobsen, F. Llirbat, and D. Shasha. WebFilter: A high-throughput XML-based publish and subscribe system. In Proc. VLDB, 2001.
M. Petrovic, I. Burcea, and H.-A. Jacobsen. S-ToPSS: Semantic Toronto publish/subscribe system. In Proc. VLDB, 2003.
M. Petrovic, H. Liu, and H.-A. Jacobsen. G-ToPSS: Fast filtering of graph-based metadata. In Proc. WWW, 2005.
J. Wang, B. Jin, and J. Li. An ontology-based publish/subscribe system. In Proc. Middleware, 2004.

Affiliated with

Also associated with

Rating

Processing overlapping continuous 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 Processing overlapping continuous queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Processing overlapping continuous queries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4283970