Alon Y. Levy
Yehoshua Sagiv
- CGM88.U.S. Chakravarthy, John Grant, and Jack Minker. Foundations of semantic query optimization for deductive databases. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 243- 273. Morgan Kaufmann, Los Altos, CA, 1988. Google Scholar
Digital Library
- CGMH+94.Sudarshan Chawathe, Hector Garcia-Molina, Joachim Hammer, Kelly Ireland, Yannis Papakonstantinon, Jeffrey Ullman, and Jennifer Widom. The TSIMMIS project: Integration of heterogeneous information sources. In proceedings of IPSJ, Tokyo, Japan, October 1994.Google Scholar
- CV92.Surajit Chaudhuri and Moshe Vardi. On the equivalence of recursive and nonrecursive datalog programs. In The Proceedings of the Eleventh A CM SIGA CT-SIGMOD-SIGART Symposium on Principles of Database Systems, San Diego, CA., pages 55-66, 1992. Google ScholarDigital Library
- Kin81.J.J. King. Query Optimization by Semantic Reasoning. PhD thesis, Stanford University, Stanford, CA, 1981. Google ScholarDigital Library
- Klu88.A. Klug. On conjunctive queries containing inequalities. Journal of the ACM, pages 35(1): 146-160, 1988. Google ScholarDigital Library
- LMS94.Alon Y. Levy, Inderpal Singh Mumick, and Yehoshua Sagiv. Query optimization by predicate move-around. In Proceedings of the 20th VLDB Conference, Santiago, Chile, 1994. Google ScholarDigital Library
- LMSS93.Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagiv, and Oded Shmueli. Equivalence, query-teachability and satisfiability in datalog extensions. In Proceedings of the Twelfth A CM SIGA CT-SIGMOD-SIGART Symposium on Principles of Database Systems, Washington D.C., 1993. Google ScholarDigital Library
- LS92.Alon Y. Levy and Yehoshua Sagiv. Constraints and redundancy in Datnlog. In The Proceedings of the Eleventh A CM SIGACT- SIGMOD-SIGART Symposium on Principles of Database Systems, San Diego, CA., pages 67-80, 1992. Google ScholarDigital Library
- LS93.Alon Y. Levy and Yehoshua Sagiv. Queries independent of updates. In Proceedings of the 19th VLDB Conference, Dublin, Ireland, pages 171-18#, 1993. Google ScholarDigital Library
- LSK95.Alon Y. Levy, Divesh Srivastava, and Thomas Kirk. Data model and query evaluation in global information systems. Journal of Intelligent Information Systems, 1995. Special Issue on Networked Information Discovery and Retrieval (to appear). Google ScholarDigital Library
- SY81.Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and difference operators. In J. A CM PT:4 pp. 633-655, 1981. Google ScholarDigital Library
- Ull89.Jeffrey D. Ullman. Principles of Database and Knowledge-base Systems, Volumes I, 1I. Computer Science Press, Rockville MD, 1989. Google ScholarDigital Library
- Var89.Moshe Y. Vardi. Automata theory for database theoreticians. In Proceedings of the Eighth Symposium on Principles of Database Systems (PODS), pages 83-92, March 1989. Google ScholarDigital Library
- vdM92a.Ron van der Meyden. The complexity of querying indefinite data about linearly ordered domains. In The Proceedings of the Eleventh A CM SIGA CT-SIGMOD-SIGART Symposium on Principles of Database Systems, San Diego, CA., pages 331-345, 1992. Google ScholarDigital Library
- vdM92b.Ron van der Meyden. The Complexity of Querying Indefinite Information: Defined Relations Recursion and Linear Order. PhD thesis, Rutgers University, New Brunswick, New Jersey, 1992. Google ScholarDigital Library
Index Terms
- Semantic query optimization in Datalog programs (extended abstract)
Recommendations
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
We study the problem of rewriting a Disjunctive Datalog program into an equivalent plain Datalog program (i.e., one that entails the same facts for every dataset). We show that a Disjunctive Datalog program is Datalog rewritable if and only if it can be ...
Query Optimization for Ontology-Mediated Query Answering
WWW '24: Proceedings of the ACM on Web Conference 2024Ontology-mediated query answering (OMQA) consists in asking database queries on knowledge bases (KBs); a KB is a set of facts called the KB's database, which is described by domain knowledge called the KB's ontology. A widely-investigated OMQA technique ...
Comments