Data structures and network algorithms
Data structures and network algorithms
Query optimization by semantic reasoning
Query optimization by semantic reasoning
Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On conjunctive queries containing inequalities
Journal of the ACM (JACM)
Efficient tests for top-down termination of logical rules
Journal of the ACM (JACM)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Partition Strategy for Distributed Query Processing in Fast Local Networks
IEEE Transactions on Software Engineering
Processing Implication on Queries
IEEE Transactions on Software Engineering
Logic-based approach to semantic query optimization
ACM Transactions on Database Systems (TODS)
Introduction to algorithms
Data structures and algorithm analysis
Data structures and algorithm analysis
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Communications of the ACM
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Data Structures and Algorithms
Data Structures and Algorithms
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Automatic Knowledge Acquisition and Maintenance for Semantic Query Optimization
IEEE Transactions on Knowledge and Data Engineering
Semantic Query Optimization for Tree and Chain Queries
IEEE Transactions on Knowledge and Data Engineering
An Improved Algorithm for Implication Testing Involving Arithmetic Inequalities
IEEE Transactions on Knowledge and Data Engineering
Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Solving satisfiability and implication problems in database systems
ACM Transactions on Database Systems (TODS)
Algorithms and Support for Horizontal Class Partitioning in Object-Oriented Databases
Distributed and Parallel Databases
Optimization of sequence queries in database systems
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Enhancing data warehouse performance through query caching
ACM SIGMIS Database
Enhancing data warehouse performance through query caching
ACM SIGMIS Database
IEEE Transactions on Knowledge and Data Engineering
Semantic Caching and Query Processing
IEEE Transactions on Knowledge and Data Engineering
Complex Temporal Patterns Detection over Continuous Data Streams
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
PartJoin: An Efficient Storage and Query Execution for Data Warehouses
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
Schema Evolution in SQL-99 and Commercial (Object-)Relational DBMS
FoMLaDO/DEMM 2000 Selected papers from the 9th International Workshop on Foundations of Models and Languages for Data and Objects, Database Schema Evolution and Meta-Modeling
The VLDB Journal — The International Journal on Very Large Data Bases
Expressing and optimizing sequence queries in database systems
ACM Transactions on Database Systems (TODS)
Constructing search spaces for materialized view selection
Proceedings of the 7th ACM international workshop on Data warehousing and OLAP
Deciding equivalences among conjunctive aggregate queries
Journal of the ACM (JACM)
Pruning search space of physical database design
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
Satisfiability, equivalence, and implication problems involving conjunctive queries are important and widely encountered problems in database management systems. These problems need to be efficiently and effectively solved. In this paper, we consider queries which are conjunctions of the inequalities of the form (XopC), (XopY), and/or (XopY + C), where X and Y are two attributes, C is a constant, and op驴 {, 驴}. These types of inequalities are widely used in database systems, since the first type is a selection, the second type is a 驴-join, and the third type is a very popular clause in a deductive database system. The satisfiability, equivalence, and implication problems in the integer domain (for attributes and constants) have been shown to be NP-hard [20], [24]. However, we show that these problems can be solved efficiently in the real domain. The incorporation of the real domain is significant, because the real domain is practically and widely used in a database. Necessary and sufficient conditions and algorithms are presented. A novel concept of the "modulo closure" and a set of sound and complete axioms with respect to the "modulo closure" are also proposed to infer all correct and necessary inequalities from a given query. The proposed axioms generalize Ullman's axioms [27] where queries only consist of 驴-joins.