Incrementally computing ordered answers of acyclic conjunctive queries

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

Volumn 4032 LNCS, Issue , 2006, Pages 141-152

  Kimelfeld, Benny ^a   Sagiv, Yehoshua ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; INFORMATION TECHNOLOGY; POLYNOMIALS; THEOREM PROVING; WORLD WIDE WEB;

ACYCLIC CONJUNCTIVE QUERIES; SQL QUERIES; TRACTABILITY; WEB APPLICATIONS;

QUERY LANGUAGES;

EID: 33746966067     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780991_13     Document Type: Conference Paper

References (16)

1. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. J. ACM, 30(3):479-513, 1983.
2. P. A. Bernstein and N. Goodman. Power of natural semijoins. SIAM J. Comput., 10(4):751-771, 1981.
3. M. J. Carey and D. Kossmann. On saying "enough already!" in SQL. In SIGMOD, pages 219-230, 1997.
4. M. J. Carey and D. Kossmann. Reducing the braking distance of an SQL query engine. In VLDB, pages 158-169, 1998.
5. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, pages 77-90, 1977.
6. S. Cohen and Y. Sagiv. An incremental algorithm for computing ranked full disjunctions. In PODS, 2005.
7. R. Fagin. Combining fuzzy information from multiple systems. J. Comput. Syst. Sci., 58(1):83-99, 1999.
8. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4):614-656, 2003.
9. D. Habich, W. Lehner, and A. Hinneburg. Optimizing multiple top-k queries over joins. In SSDBM, pages 195-204, 2005.
10. V. Hristidis, N. Koudas, and Y. Papakonstantinou. PREFER: A system for the efficient execution of multi-parametric ranked queries. In SIGMOD, 2001.
11. I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting top-k join queries in relational databases. In VLDB, pages 754-765, 2003.
12. D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27:119-123, March 1988.
13. E. L. Lawler. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Science, 18:401-405, 1972.
14. A. Natsev, Y. C. Chang, J. R. Smith, C. S. Li, and J. S. Vitter. Supporting incremental join queries on ranked inputs. In VLDB, pages 281-290, 2001.
15. M. Yannakakis. Algorithms for acyclic database schemes. In VLDB, pages 82-94, 1981.
16. J. Y. Yen. Another algorithm for finding the k shortest loopless network paths. In "Proc. 41st Mtg. Operations Research Society of America", volume 20, page B/185, 1972.