Efficient query monitoring using adaptive multiple key hashing

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2002, Pages 477-484

  Wu, Kun Lung ^a   Yu, Philip S ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Adaptive multiple key hashing; Continual queries; Publish subscribe; Query indexing; Query monitoring

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA STRUCTURES; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL SYSTEMS; QUERY LANGUAGES; XML;

ADAPTIVE MULTIPLE KEY HASHING; CONTINUAL QUERIES; PUBLISH-SUBSCRIBE; QUERY INDEXING; QUERY MONITORING;

STORAGE ALLOCATION (COMPUTER);

EID: 0038494774     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/584792.584871     Document Type: Conference Paper

References (13)

1. M. K. Aguilera, R. E. Strom, D. C. Sturman, M. Astley, and T. D. Chandra. Matching events in a content-based subscription system. In Proc. of Symp. on Principles of Distributed Computing, 1999.
2. M. Altinel and M. J. Franklin. Efficient filtering of XML documents for selective dissemination of information. In Proc. of Very Large Data Bases, pages 53-64, 2000.
3. A. Carzaniga, D. S. Rosenblum, and A. L. Wolf Achieving expressiveness and scalability in an Internet-scale event notification service. In Proc. of Symp. on Principles of Distributed Computing, pages 219-227, 2000.
4. J. Chen, D. DeWitt, F. Tian, and Y. Wang. NiagaraCQ: A scalable continuous query system for Internet databases. In Proc. of ACM SIGMOD Int. Conf. on Management of Data, pages 379-390, 2000.
5. F. Fabret, H. A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, and D. Shasha. Filtering algorithms and implementation for every fast publish/subscribe systems. in Proc. of the ACM SIGMOD, 2001.
6. E. Hanson, C. Carnes, L. Huang, M. Konyala L. Noronha, S. Parthasarathy, J. B. Park, and A. Vernon. Scalable trigger processing. In Proc. of Int. Conf. on Data Engineering, pages 266-275, 1999.
7. E. Hanson, M. Chaabom, C.-H. Kim and Y.-W. Wang. A predicate matching algorithm for database rule systems. In Proc. of ACM SIGMOD Int. Conf. on Management of Data, pages 271-280, 1990.
8. E. Hanson and T. Johnson. Selection predicate indexing for active databases using interval skip lists. Information Systems, 21(3): 269-298, 1996.
9. D. E. Knuth. The Art of Computer Programming. Vol 3: Sorting and Searching. Addison-Wesley, 1973.
10. L. Liu, C. Pu, and W. Tang. Continual queries for Internet scale event-driven information delivery. IEEE Trans. on Knowledge and Data Engineering, 11(4):610-628, July/Aug. 1999.
11. J. Pereira, F. Fabret, F. Llirbat, and D. Shasha. Efficient matching for Web-based publish/subscribe systems. In Proc. of Int. Conf. on Cooperative Information Systems, pages 162-173, 2000.
12. H. Samet. Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
13. T. Yan and H. Garcia-Molina. The SIFT information dissemination system. ACM Trans. on Database Systems, 24(4): 529-565, Dec. 1999.