|
ABSTRACT
Conjunctive queries are generalized so that inequality comparisons can be made between elements of the query. Algorithms for containment and equivalence of such “inequality queries” are given, under the assumption that the data domains are dense and totally ordered. In general, containment does not imply the existence of homomorphisms (containment mappings), but the homomorphism property does exist for subclasses of inequality queries. A minimization algorithm is defined using the equivalence algorithm. It is first shown that the constants appearing in a query can be divided into “essential” and “nonessential” subgroups. The minimum query can be nondeterministically guessed using only the essential constants of the original query.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
AHO, A. V., SAGIV, Y., AND ULLMAN, J.O. Equivalences among relational expressions. SIAM J. Comput. 8, 2 (May 1979), 218-246.
|
 |
3
|
M. M. Astrahan , M. W. Blasgen , D. D. Chamberlin , K. P. Eswaran , J. N. Gray , P. P. Griffiths , W. F. King , R. A. Lorie , P. R. McJones , J. W. Mehl , G. R. Putzolu , I. L. Traiger , B. W. Wade , V. Watson, System R: relational approach to database management, ACM Transactions on Database Systems (TODS), v.1 n.2, p.97-137, June 1976
[doi> 10.1145/320455.320457]
|
| |
4
|
BEERI, C., BERNSTEIN, P., AND GOODMAN, N. A sophistieate's introduction to database normalization theory. In Proceedings of the 1978 VLDB Conference (West Berlin). 1978.
|
 |
5
|
|
| |
6
|
CODD, E.F. Relational completeness of data base sublanguages. In Data Base Systems, R. Rustin, Ed. Prentice-Hall, Englewood Cliffs, N.J., 1972.
|
 |
7
|
|
| |
8
|
JOHNSON, D., AND KLUG, A. Optimizing conjunctive queries that contain untyped variables. SIAMJ. Comput. 12, 4 (Nov. 1983), 616-640.
|
| |
9
|
JOHNSON, D., AND KLUG, A. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28, 1 (Feb. 1984), 167-189.
|
| |
10
|
SAGIV, Y. Quadratic algorithms for minimizing joins in restricted relational expressions. Tech. Rep. UIUCDCS-R-79-992. Computer Science Dept., Univ. of Illinois, Urbana, I11., 1979.
|
 |
11
|
|
| |
12
|
SHOVNFIELD, J.R. Mathematical Logic. Addison-Wesley, Reading, Mass., 1967.
|
 |
13
|
|
 |
14
|
|
| |
15
|
ULLMAN, J. D. A view of directions in relational database theory. Rep. STAN-CS-81-852. Computer Science Dept., Stanford Univ., Stanford, Calif., 1981.
|
| |
16
|
YANNAKAKIS, M., AND PAPADIMITRIOU, C. Algebraic dependencies. J. Comput. Syst. Sci. 25, 1 (1982), 2--41.
|
CITED BY 78
|
|
|
|
|
Ashish Gupta , Yehoshua Sagiv , Jeffrey D. Ullman , Jennifer Widom, Constraint checking with partial information, Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.45-55, May 24-27, 1994, Minneapolis, Minnesota, United States
|
|
|
Marc Andries , Luca Cabibbo , Jan Paredaens , Jan Van den Bussche, Applying an update method to a set of receivers (extended abstract), Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.208-218, May 22-25, 1995, San Jose, California, United States
|
|
|
Daniela Florescu , Alon Levy , Dan Suciu, Query containment for conjunctive queries with regular expressions, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.139-148, June 01-04, 1998, Seattle, Washington, United States
|
|
|
Phokion G. Kolaitis , David L. Martin , Madhukar N. Thakur, On the complexity of the containment problem for conjunctive queries with built-in predicates, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.197-204, June 01-04, 1998, Seattle, Washington, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Anand Rajaraman , Yehoshua Sagiv , Jeffrey D. Ullman, Answering queries using templates with binding patterns (extended abstract), Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.105-112, May 22-25, 1995, San Jose, California, United States
|
|
|
|
|
|
|
|
|
Todd Millstein , Alon Levy , Marc Friedman, Query containment for data integration systems, Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.67-75, May 15-18, 2000, Dallas, Texas, United States
|
|
|
Diego Calvanese , Giuseppe De Giacomo , Maurizio Lenzerini, On the decidability of query containment under constraints, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.149-158, June 01-04, 1998, Seattle, Washington, United States
|
|
|
|
|
|
Alon Y. Levy , Anand Rajaraman , Jeffrey D. Ullman, Answering queries using limited external query processors (extended abstract), Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.227-237, June 04-06, 1996, Montreal, Quebec, Canada
|
|
|
|
|
|
Paris C. Kanellakis , Gabriel M. Kuper , Peter Z. Revesz, Constraint query languages (preliminary report), Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.299-313, April 02-04, 1990, Nashville, Tennessee, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Wenfei Fan , Floris Geerts , Wouter Gelade , Frank Neven , Antonella Poggi, Complexity and composition of synthesized web services, Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 09-12, 2008, Vancouver, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Faiz Currim , Eunjin Jung , Xin Xiao , Insoon Jo, Privacy policy enforcement for health information data access, Proceedings of the 1st ACM international workshop on Medical-grade wireless networks, May 18-18, 2009, New Orleans, Louisiana, USA
|
|
|
|
|
|
|
REVIEW
"Kazem Taghva : Reviewer"
Conjunctive queries are a subset of domain calculus expressions built
from relational atomic formulas using the logical connective and.> In the
database setting, the connective and> is interpreted as the join>
opera
more...
|