Machine models and lower bounds for query processing

This paper gives an overview of recent work on machine models for processing massive amounts of data. The main focus is on generalizations of the classical data stream model where, apart from an "internal memory" of limited size, also a number of (potentially huge) streams may be used as "external memory devices".

[1]  Matthias Ruhl,et al.  Efficient algorithms for new computational models , 2003 .

[2]  Nicole Schweikardt,et al.  Lower bounds for sorting with few random accesses to external memory , 2005, PODS.

[3]  Hao Zhang,et al.  Path sharing and predicate evaluation for high-performance XML filtering , 2003, TODS.

[4]  Jan Van den Bussche,et al.  Database Query Processing Using Finite Cursor Machines , 2007, Theory of Computing Systems.

[5]  Mayur Datar,et al.  On the streaming model augmented with a sorting primitive , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[6]  Cristina Sirangelo,et al.  Constant-Memory Validation of Streaming XML Documents Against DTDs , 2007, ICDT.

[7]  Marcus Fontoura,et al.  Buffering in query evaluation over XML streams , 2005, PODS '05.

[8]  Atri Rudra,et al.  Lower bounds for randomized read/write stream algorithms , 2007, STOC '07.

[9]  Jeffrey Scott Vitter.  External memory algorithms , 1998, PODS '98.

[10]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures: dealing with massive data , 2001, CSUR.

[11]  Rajeev Rastogi,et al.  Efficient filtering of XML documents with XPath expressions , 2002, The VLDB Journal.

[12]  Jennifer Widom,et al.  Models and issues in data stream systems , 2002, PODS.

[13]  Nicole Schweikardt,et al.  Tight lower bounds for query processing on streaming and external memory data , 2007, Theor. Comput. Sci..

[14]  Nicole Schweikardt,et al.  Lower bounds for processing data with few random accesses to external memory , 2009, JACM.

[15]  Nicole Schweikardt,et al.  Randomized computations on large data sets: tight lower bounds , 2006, PODS.

[16]  Camil Demetrescu,et al.  Trading off space for passes in graph streaming problems , 2009, SODA '06.

[17]  Georg Gottlob,et al.  The complexity of XPath query evaluation , 2003, PODS.

[18]  Christoph Koch,et al.  Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach , 2003, VLDB.

[19]  Victor Vianu,et al.  Validating streaming XML documents , 2002, PODS.

[20]  Nicole Schweikardt,et al.  The Complexity of Querying External Memory and Streaming Data , 2005, FCT.

[21]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[22]  Jop F. Sibeyn,et al.  Algorithms for Memory Hierarchies: Advanced Lectures , 2003 .

[23]  Ulrich Meyer,et al.  Algorithms for Memory Hierarchies , 2003, Lecture Notes in Computer Science.

[24]  Noam Nisan,et al.  Rounds in communication complexity revisited , 1991, STOC '91.

[25]  Dan Suciu,et al.  Processing XML streams with deterministic automata and stream indexes , 2004, TODS.

[26]  Dan Olteanu,et al.  SPEX: Streamed and Progressive Evaluation of XPath , 2007, IEEE Transactions on Knowledge and Data Engineering.

[27]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[28]  Nicole Schweikardt,et al.  Reversal complexity revisited , 2006, Theor. Comput. Sci..

[29]  Artur Czumaj,et al.  Sublinear-Time Algorithms , 2006, Bull. EATCS.

[30]  G. Szekeres,et al.  A combinatorial problem in geometry , 2009 .

[31]  Jianer Chen,et al.  Reversal Complexity , 2015, SIAM J. Comput..

[32]  Prabhakar Raghavan,et al.  Computing on data streams , 1999, External Memory Algorithms.

[33]  Noga Alon,et al.  The space complexity of approximating the frequency moments , 1996, STOC '96.

[34]  Marcus Fontoura,et al.  On the memory requirements of XPath evaluation over XML streams , 2004, PODS.