Monitoring continuous band-join queries over dynamic data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3827 LNCS, Issue , 2005, Pages 349-359

  Agarwal, Pankaj K ^a   Xie, Junyi ^a   Yang, Jun ^a   Yu, Hai ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DISTRIBUTED DATABASE SYSTEMS; INDEXING (OF INFORMATION); PARAMETER ESTIMATION; PROBLEM SOLVING; QUERY LANGUAGES; RESPONSE TIME (COMPUTER SYSTEMS); SET THEORY;

BAND-JOINS; SUBLINEAR QUERY TIME; SUBQUADRATIC SPACE; SUBSETS;

DATA STRUCTURES;

EID: 33744964014     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_36     Document Type: Conference Paper

References (16)

1. P. K. Agarwal, J. Xie, J. Yang, and H. Yu. Monitoring continuous band-join queries over dynamic data. Technical report, Department of Computer Science, Duke University, Durham, North Carolina, USA, Sept. 2005. Available at http://www.cs.duke.edu/dbgroup/papers/2005-axyy-joinidx.pdf.
2. A. Bagchi, A. Chaudhary, D. Eppstein, and M. Goodrich. Deterministic sampling and range counting in geometry data streams. In Proc. 20th ACM Sympos. Comput. Geom., pages 144-151, 2004.
3. D. Carney et al. Monitoring streams: A new class of data management applications. In Proc. 28th Intl. Conf. on Very Large Data Bases, pages 215-226, 2002.
4. S. Chandrasekaran and M. J. Franklin. Streaming queries over streaming data. In Proc. 28th Intl. Conf. on Very Large Data Bases, pages 203-214, 2002.
5. S. Chandrasekaran and M. J. Franklin. PSoup: a system for streaming queries over streaming data. The VLDB Journal, 12(2): 140-156, 2003.
6. J. Chen, D. J. DeWitt, F. Tian, and Y. Wang. NiagraCQ: A scalable continuous query system for internet databases. In Proc. 19th ACM SIGMOD Intl. Conf. on Management of Data, pages 379-390, 2000.
7. Y.-J. Chiang and R. Tamassia. Dynamic algorithms in computational geometry. Computational Geometry: Theory & Applications, 80(9):1412-1434, 1992.
8. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2nd edition, 2000.
9. D. DeWitt, J. Naughton, and D. Schneider. An evaluation of nonequijoin algorithms. In Proc. 17th Intl. Conf. on Very Large Data Bases, pages 443-452, 1991.
10. A. Dumitrescu and W. Steiger. Space-time tradeoffs for some ranking and searching queries. Inform. Process. Lett., 79(5):237-241, 2001.
11. M. Fredman. How good is the information theory bound on sorting? Theoret. Comput. Sci., 1:355-361, 1976.
12. S. Guha, N. Koudas, and K. Shim. Data streams and histograms. In Proc. 33rd ACM Sympos. Theory of Computing, pages 471-475, 2001.
13. 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, 1999.
14. S. Muthukrishnan. Data streams: algorithms and applications. Available at http://www.cs.rutgers.edu/~muthu.
15. M. H. Overmars. The Design of Dynamic Data Structures. Lecture Notes in Computer Science. Springer-Verlag, NY, 1987.
16. S. Suri, C. Toth, and Y. Zhou. Range counting over multidimensional data streams. In Proc. 20th A CM Sympos. Comput. Geom., pages 160-169, 2004.