Processing Conjunctive Predicates and Queries.
Daniel J. Rosenkrantz, Harry B. Hunt III:
Processing Conjunctive Predicates and Queries.
VLDB 1980: 64-72@inproceedings{DBLP:conf/vldb/RosenkrantzH80,
author = {Daniel J. Rosenkrantz and
Harry B. Hunt III},
title = {Processing Conjunctive Predicates and Queries},
booktitle = {Sixth International Conference on Very Large Data Bases, October
1-3, 1980, Montreal, Quebec, Canada, Proceedings},
publisher = {IEEE Computer Society},
year = {1980},
pages = {64-72},
ee = {db/conf/vldb/RosenkrantzH80.html},
crossref = {DBLP:conf/vldb/80},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
Several aspects of relational database systems
require the processing of predicates. For example,
predicates can be tested for satisfiability (as in
processing predicate locks), and predicates occurring in queries may be preprocessed in order to
reduce the number of database operations when the
query is answered. Here we study predicates consisting of conjunctions of comparisons.
First, we consider predicates that are conjunctions of =, <, <= , >, and >= comparisons, where a
variable can be compared with a constant or with
another variable, possibly offset by a constant.
Efficient algorithms are given for satisfiability,
equivalence, and minimizing the number of comparisons in a predicate.
Second, we show that when unequal comparisons
between variables are allowed, satisfiability, equivalence, and minimization are NP-hard.
Most approximation problems corresponding to minimization are
also NP-hard. The preceding efficient algorithms
show that the unequal comparison operation is the sole
cause of this complexity.
Copyright © 1980 by The Institute of
Electrical and Electronic Engineers, Inc. (IEEE).
Abstract used with permission.
CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
Printed Edition
Sixth International Conference on Very Large Data Bases, October 1-3, 1980, Montreal, Quebec, Canada, Proceedings.
IEEE Computer Society 1980
Contents BibTeX
References
- [1]
- Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman:
Equivalences Among Relational Expressions.
SIAM J. Comput. 8(2): 218-246(1979) BibTeX
- [2]
- Morton M. Astrahan, Mike W. Blasgen, Donald D. Chamberlin, Kapali P. Eswaran, Jim Gray, Patricia P. Griffiths, W. Frank King III, Raymond A. Lorie, Paul R. McJones, James W. Mehl, Gianfranco R. Putzolu, Irving L. Traiger, Bradford W. Wade, Vera Watson:
System R: Relational Approach to Database Management.
ACM Trans. Database Syst. 1(2): 97-137(1976) BibTeX
- [3]
- Ashok K. Chandra, Philip M. Merlin:
Optimal Implementation of Conjunctive Queries in Relational Data Bases.
STOC 1977: 77-90 BibTeX
- [4]
- ...
- [5]
- Stephen A. Cook:
The Complexity of Theorem-Proving Procedures.
STOC 1971: 151-158 BibTeX
- [6]
- ...
- [7]
- Kapali P. Eswaran:
Aspects of a Trigger Subsystem in an Integrated Data Base System.
ICSE 1976: 243-250 BibTeX
- [8]
- Kapali P. Eswaran, Donald D. Chamberlin:
Functional Specifications of Subsystem for Database Integrity.
VLDB 1975: 48-68 BibTeX
- [9]
- Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger:
The Notions of Consistency and Predicate Locks in a Database System.
Commun. ACM 19(11): 624-633(1976) BibTeX
- [10]
- J. J. Florentin:
Consistency Auditing of Databases.
Comput. J. 17(1): 52-58(1974) BibTeX
- [11]
- ...
- [12]
- M. R. Garey, David S. Johnson, Larry J. Stockmeyer:
Some Simplified NP-Complete Graph Problems.
Theor. Comput. Sci. 1(3): 237-267(1976) BibTeX
- [13]
- Patricia P. Griffiths, Bradford W. Wade:
An Authorization Mechanism for a Relational Database System.
ACM Trans. Database Syst. 1(3): 242-255(1976) BibTeX
- [14]
- Harry B. Hunt III, Daniel J. Rosenkrantz:
The Complexity of Testing Predicate Locks.
SIGMOD Conference 1979: 127-133 BibTeX
- [15]
- ...
- [16]
- Rudolf Munz, H.-J. Schneider, Frank Steyer:
Application of Sub-Predicate Tests in Database Systems.
VLDB 1979: 426-435 BibTeX
- [17]
- ...
- [18]
- Daniel R. Ries, Michael Stonebraker:
Effects of Locking Granularity in a Database Management System.
ACM Trans. Database Syst. 2(3): 233-246(1977) BibTeX
- [19]
- Gunter Schlageter:
The Problem of Lock by Value in Large Data Bases.
Comput. J. 19(1): 17-20(1976) BibTeX
- [20]
- Michael Stonebraker, Erich J. Neuhold:
A Distributed Database Version of INGRES.
Berkeley Workshop 1977: 19-36 BibTeX
- [21]
- Kai C. Wong, Murray Edelberg:
Interval Hierarchies and Their Application to Predicate Files.
ACM Trans. Database Syst. 2(3): 223-232(1977) BibTeX
Referenced by
- Naci Ishakbeyoglu, Z. Meral Özsoyoglu:
Maintenance of Implication Integrity Constraints Under Updates to Constraints.
VLDB J. 7(2): 67-78(1998)
- Fa-Chung Fred Chen, Margaret H. Dunham:
Common Subexpression Processing in Multiple-Query Processing.
IEEE Trans. Knowl. Data Eng. 10(3): 493-499(1998)
- Domenico Beneventano, Sonia Bergamaschi, Stefano Lodi, Claudio Sartori:
Consistency Checking in Complex Object Database Schemata with Integrity Constraints.
IEEE Trans. Knowl. Data Eng. 10(4): 576-598(1998)
- Sha Guo, Wei Sun, Mark Allen Weiss:
Solving Satisfiability and Implication Problems in Database Systems.
ACM Trans. Database Syst. 21(2): 270-293(1996)
- Sha Guo, Wei Sun, Mark Allen Weiss:
On Satisfiability, Equivalence, and Impication Problems Involving Conjunctive Queries in Database Systems.
IEEE Trans. Knowl. Data Eng. 8(4): 604-616(1996)
- Thodoros Topaloglou, John Mylopoulos:
Representing Partial Spatial Information in Databases.
ER 1996: 325-340
- Nick Roussopoulos, Chung-Min Chen, Stephen Kelley, Alex Delis, Yannis Papakonstantinou:
The ADMS Project: View R Us.
IEEE Data Eng. Bull. 18(2): 19-28(1995)
- Marianne Baudinet, Jan Chomicki, Pierre Wolper:
Constraint-Generating Dependencies.
ICDT 1995: 322-337
- Wei Sun, Mark Allen Weiss:
An Improved Algorithm for Implication Testing Involving Arithmetic Inequalities.
IEEE Trans. Knowl. Data Eng. 6(6): 997-1001(1994)
- Alfons Kemper, Christoph Kilger, Guido Moerkotte:
Function Materialization in Object Bases: Design, Realization, and Evaluation.
IEEE Trans. Knowl. Data Eng. 6(4): 587-608(1994)
- Arantza Illarramendi, José Miguel Blanco, Alfredo Goñi:
Making the Knowledge Base System More Efficient: A Method to Detect Inconsistent Queries.
IEEE Trans. Knowl. Data Eng. 6(4): 634-639(1994)
- Martin F. van Bommel, Grant E. Weddell:
Reasoning About Equations and Functional Dependencies on Complex Objects.
IEEE Trans. Knowl. Data Eng. 6(3): 455-469(1994)
- Yang Hee Kim, Hyoung-Joo Kim:
Applying Intensional Query Processing Techniques to Object-Oriented Database Systems.
DASFAA 1993: 405-412
- Nabil Kamel, Roger King:
Intelligent Database Caching Through the Use of Page-Answers and Page-Traces.
ACM Trans. Database Syst. 17(4): 601-646(1992)
- T. Y. Cliff Leung, Richard R. Muntz:
Temporal Query Processing and Optimization in Multiprocessor Database Machines.
VLDB 1992: 383-394
- Ron van der Meyden:
The Complexity of Querying Indefinite Data about Linearly Ordered Domains.
PODS 1992: 331-345
- Thodoros Topaloglou, Arantza Illarramendi, Licia Sbattella:
Query Optimization for KBMSs: Temporal, Syntactic and Semantic Transformantions.
ICDE 1992: 310-319
- Alexander Brodsky, Yehoshua Sagiv:
Inference of Inequality Constraints in Logic Programs.
PODS 1991: 227-240
- Sharma Chakravarthy:
Divide and Conquer: A Basis for Augmenting a Conventional Query Optimizer with Multiple Query Proceesing Capabilities.
ICDE 1991: 482-490
- Arantza Illarramendi, Licia Sbattella:
Syntactic Query Processing: Dealing with Structure and Time.
DASFAA 1991: 356-365
- Michael Kifer, Eliezer L. Lozinskii:
On Compile-Time Query Optimization in Deductive Databases by Means of Static Filtering.
ACM Trans. Database Syst. 15(3): 385-426(1990)
- José A. Blakeley, Neil Coburn, Per-Åke Larson:
Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates.
ACM Trans. Database Syst. 14(3): 369-400(1989)
- Sreekumar T. Shenoy, Z. Meral Özsoyoglu:
Design and Implementation of a Semantic Query Optimizer.
IEEE Trans. Knowl. Data Eng. 1(3): 344-361(1989)
- Xian-He Sun, Nabil Kamel, Lionel M. Ni:
Solving Implication Problems in Database Applications.
SIGMOD Conference 1989: 185-192
- Alain Pirotte, Dominique Roelants:
Constraints for Improving the Generation of Intensional Answers in a Deductive Database.
ICDE 1989: 652-659
- Timos K. Sellis:
Multiple-Query Optimization.
ACM Trans. Database Syst. 13(1): 23-52(1988)
- Jooseok Park, Arie Segev:
Using Common Subexpressions to Optimize Multiple Queries.
ICDE 1988: 311-319
- H. Z. Yang, Per-Åke Larson:
Query Transformation for PSJ-Queries.
VLDB 1987: 245-254
- Timos K. Sellis:
Efficiently Supporting Procedures in Relational Database Systems.
SIGMOD Conference 1987: 278-291
- Yannis E. Ioannidis, Eugene Wong:
Query Optimization by Simulated Annealing.
SIGMOD Conference 1987: 9-22
- Michael Kifer, Eliezer L. Lozinskii:
Implementing Logic Programs as a Database System.
ICDE 1987: 375-385
- Wojtek Kozaczynski, Leszek Lilien:
An Extended Entity-Relationship (E²R) Database Specification and its Automatic Verification and Transformation into the Logical Relational Design.
ER 1987: 533-549
- Stefan Böttcher, Matthias Jarke, Joachim W. Schmidt:
Adaptive Predicate Managers in Database Systems.
VLDB 1986: 21-29
- José A. Blakeley, Neil Coburn, Per-Åke Larson:
Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates.
VLDB 1986: 457-466
- José A. Blakeley, Per-Åke Larson, Frank Wm. Tompa:
Efficiently Updating Materialized Views.
SIGMOD Conference 1986: 61-71
- Michael Kifer, Eliezer L. Lozinskii:
Filtering Data Flow in Deductive Databases.
ICDT 1986: 186-202
- Per-Åke Larson, H. Z. Yang:
Computing Queries from Derived Relations.
VLDB 1985: 259-269
- Matthias Jarke, Jürgen Koch:
Query Optimization in Database Systems.
ACM Comput. Surv. 16(2): 111-152(1984)
- Matthias Jarke, James Clifford, Yannis Vassiliou:
An Optimizing Prolog Front-End to a Relational Query System.
SIGMOD Conference 1984: 296-306
- Manuel Reimer:
Solving the Phantom Problem by Predicative Optimistic Concurrency Control.
VLDB 1983: 81-88
- Matthias Jarke, Jürgen Koch:
Range Nesting: A Fast Method to Evaluate Quantified Queries.
SIGMOD Conference 1983: 196-206
- Sheldon J. Finkelstein:
Common Subexpression Analysis in Database Applications.
SIGMOD Conference 1982: 235-245
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
VLDB Proceedings (1977-1981): Copyright © by IEEE,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:45:08 2009