Database query processing using finite cursor machines

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

Volumn 4353 LNCS, Issue , 2006, Pages 284-298

  Grohe, Martin ^a   Gurevich, Yuri ^b   Leinders, Dirk ^c   Schweikardt, Nicole ^a   Tyszkiewicz, Jerzy ^d   Van Den Bussche, Jan ^c  

^a HUMBOLDT UNIVERSITY   (Germany)

^b MICROSOFT RESEARCH   (United States)

^c HASSELT UNIVERSITY   (Belgium)

^d UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT MODELS; ABSTRACT STATE MACHINES; DATA STREAMING; DATABASE QUERY PROCESSING; ONE-PASS; RELATIONAL ALGEBRA; UPPER AND LOWER BOUNDS;

ALGEBRA; DATABASE SYSTEMS;

QUERY PROCESSING;

EID: 77956603808     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11965893_20     Document Type: Conference Paper

References (30)

1. G. Aggarwal, M. Datar, S. Rajagopalan, and M. Ruhl. On the streaming model augmented with a sorting primitive. FOCS 2004, p 540-549.
2. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. JCSS, 58:137-147, 1999.
3. M. Altinel and M. Franklin. Efficient filtering of XML documents for selective dissemination of information. VLDB 2000, p 53-64.
4. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. PODS 2002, p 1-16.
5. Z. Bar-Yossef, M. Fontoura, and V. Josifovski. On the memory requirements of XPath evaluation over XML streams. PODS 2004, p 177-188.
6. Z. Bar-Yossef, M. Fontoura, and V. Josifovski. Buffering in query evaluation over XML streams. PODS 2005, p 216-227.
7. C.Y. Chan, P. Felber, M.N. Garofalakis, and R. Rastogi. Efficient filtering of XML documents with XPath expressions. The VLDB Journal, 11:354-379, 2002.
8. R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer, 1999.
9. R. Fagin. Degrees of acyclicity for hypergraphs and relational database schemes. JACM, 30:514-550, 1983.
10. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006.
11. H. Garcia-Molina, J.D. Ullman, and J. Widom. Database System Implementation. Prentice Hall, 1999.
12. T.J. Green, G. Miklau, M. Onizuka, and D. Suciu. Processing XML streams with deterministic automata. ICDT 2003, p 173-189.
13. M. Grohe, C. Koch, and N. Schweikardt. Tight lower bounds for query processing on streaming and external memory data. ICALP 2005, p 1076-1088.
14. M. Grohe and N. Schweikardt. Lower bounds for sorting with few random accesses to external memory. PODS 2005, p 238-249.
15. A.K. Gupta and D. Suciu. Stream processing of XPath queries with predicates. SIGMOD 2003, p 419-430.
16. Y. Gurevich. Evolving algebras 1993: Lipari guide. In E. Börger, editor, Specification and Validation Methods, p 9-36. Oxford University Press, 1995.
17. L. Hella, L. Libkin, J. Nurmonen, and L. Wong. Logics with aggregate operators. JACM, 48(4):880-907, July 2001.
18. M. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. External Memory Algorithms. DIMACS Series In Discrete Mathematics And Theoretical Computer Science, 50:107-118, 1999.
19. J. Hromkovič. One-way multihead deterministic finite automata. Acta Informatica, 19:377-384, 1983.
20. Y-N. Law, H. Wang, and C. Zaniolo. Query languages and data models for database sequences and data streams. VLDB 2004, p 492-503.
21. D. Leinders and J. Van den Bussche. On the complexity of division and set joins in the relational algebra. PODS 2005, p 76-83.
22. D. Leinders, M. Marx, J. Tyszkiewicz, and J. Van den Bussche. The semijoin algebra and the guarded fragment. JoLLI, 14(3):331-343, 2005.
23. D. Leinders, J. Tyszkiewicz, and J. Van den Bussche. On the expressive power of semijoin queries. IPL, 91(2):93-98, 2004.
24. L. Libkin. Elements of Finite Model Theory. Springer, 2004.
25. S. Muthukrishnan. Data Streams: Algorithms and Applications. Now Publishers Inc, 2005.
26. F. Peng and S.S. Chawathe. XPath queries on streaming data. SIGMOD 2003, p 431-442.
27. A.L. Rosenberg. On multi-head finite automata. In Proceedings of the 6th IEEE Symposium on Switching Circuit Theory and Logical Design, p 221-228, 1965.
28. D. Simmen, E. Shekita, and T. Malkemus. Fundamental techniques for order optimization. SIGMOD 1996, p 57-67.
29. J. Van den Bussche. Finite cursor machines in database query processing. In Proceedings of the 11th International Workshop on ASMs, p 61-61, 2004.
30. M. Yannakakis. Algorithms for acyclic database schemes. VLDB 1981, p 82-94.