An incremental algorithm for computing ranked full disjunctions

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2005, Pages 98-107

  Cohen, Sara ^a   Sagiv, Yehoshua ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY;

BINARY OUTERJOIN OPERATORS; INCREMENTAL ALGORITHM;

DATABASE SYSTEMS;

EID: 33244492891     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065167.1065180     Document Type: Conference Paper

References (14)

1. S. Cohen and Y. Sagiv. Generating all maximal solutions for hereditary, connected-hereditary and rooted-hereditary graph properties, 2004, Manuscript available at http://www.cs.huji.ac.il/~sarina/maximal_solutions.ps.
2. S. Cohen and Y. Sagiv. An abstract framework for generating maximal answers to queries. In Proc 10th International Conference on Database Theory, Edinburgh (Scotland, UK), Jan. 2005. Springer-Verlag.
3. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In Proc. 20th Symposium on Principles of Database Systems, Santa Barbara (California, USA), May 2001, ACM Press.
4. C. Galindo-Legaria, Outerjoins as disjunctions. In Proc. 1994 ACM SIGMOD International Conference on Management of Data, pages 348-358, Minneapolis (Minnesota, USA), May 1994. ACM Press.
5. I. Ilyas, W. Aref, and A. Elmagarmid. Supporting top-k join queries in relational databases. In Proc. 28th International Conference on Very Large Data Bases, Hong Kong (China), Aug. 2002. Morgan Kaufmann Publishers.
6. I. Ilyas, R. Shah, W. Aref, J. Vitter, and A. Elmagarmid. Rank-aware query optmization. In Proc. 2004 ACM SIGMOD International Conference on Management of Data, Paris (France), June 2004. ACM Press.
7. D. Johnson, C. Papadimitriou, and M. Yannakakis. On generating all maximal independent sets. Information Processing Letters, 27(3):119-123, 1988.
8. Y. Kanza and Y. Sagiv. Computing full disjunctions. In Proc. 22nd Symposium on Principles of Database Systems, pages 78-89, San Diego (California, USA), June 2003. ACM Press.
9. D. Maier, Y. Sagiv, and M. Yannakakis. On the complexity of testing implications of functional and join dependencies. J. ACM, 28(4):680-695, 1981.
10. A. Marian, N. Bruno, and L. Gravano. Evaluating top-k queries over web-accessible databases. ACM Transactions on Database Systems, 29(2), 2004.
11. A. Natsev, Y. Chang, J. Smith, C. Li, and J. Vittier. Supporting incremental join queries on ranked inputs. In Proc. 27th International Conference on Very Large Data Bases, Rome (Italy), Sept. 2001. Morgan Kaufmann Publishers.
12. A. Rajaraman and J. Ullman. Integrating information by outerjoins and full disjunctions. In Proc. 15th Symposium on Principles of Database Systems, pages 238-248, Montreal (Canada), June 1996. ACM Press.
13. M. Vardi, On the complexity of bounded-variable queries. In Proc. 14th Symposium on Principles of Database Systems, pages 266-276, San Jose (California, USA), May 1995. ACM Press.
14. M. Yannakakis. Algorithms for acyclic database schemas. In W. Chu, G. Gardarin, S. Ohsuga, and Y. Kambayashi, editors, Proc. 7th International Conference on Very Large Data Bases, pages 82-94, Cannes (France), Sept. 1981. Morgan Kaufmann Publishers.