Algorithms for trie compaction
ACM Transactions on Database Systems (TODS)
Parallel Computer Architectures and Problem Solving Strategies for the Consistent Labeling Problem
IEEE Transactions on Computers
Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Fast implementation of relationship operations via inverse projections
The Computer Journal
Tree clustering for constraint networks (research note)
Artificial Intelligence
Optimal Semijoins for Distributed Database Systems
IEEE Transactions on Software Engineering
Join processing in relational databases
ACM Computing Surveys (CSUR)
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
PERF join: an alternative to two-way semijoin and bloomjoin
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Parallel Execution of Hash Joins in Parallel Databases
IEEE Transactions on Parallel and Distributed Systems
On the conversion between non-binary constraint satisfaction problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Encodings of non-binary constraint satisfaction problems
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Analysis of a heuristic for full trie minimization
ACM Transactions on Database Systems (TODS)
Implementing a relational database by means of specialzed hardware
ACM Transactions on Database Systems (TODS)
Journal of the ACM (JACM)
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Iterative dynamic programming: a new class of query optimization algorithms
ACM Transactions on Database Systems (TODS)
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
Database Systems: The Complete Book
Database Systems: The Complete Book
IEEE/ACM Transactions on Networking (TON)
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
An Overview of Backtrack Search Satisfiability Algorithms
Annals of Mathematics and Artificial Intelligence
Maintenance scheduling problems as benchmarks for constraint algorithms
Annals of Mathematics and Artificial Intelligence
An Average Analysis of Backtracking on Random Constraint Satisfaction Problems
Annals of Mathematics and Artificial Intelligence
On forward checking for non-binary constraint satisfaction
Artificial Intelligence
Binary vs. non-binary constraints
Artificial Intelligence
Optimization of Parallel Execution for Multi-Join Queries
IEEE Transactions on Knowledge and Data Engineering
A Trie Compaction Algorithm for a Large Set of Keys
IEEE Transactions on Knowledge and Data Engineering
Criss-Cross Hash Joins: Design and Analysis
IEEE Transactions on Knowledge and Data Engineering
Mini-buckets: A general scheme for bounded inference
Journal of the ACM (JACM)
Contradicting Conventional Wisdom in Constraint Satisfaction
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Dynamic Variable Ordering in CSPs
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Solving Non-binary CSPs Using the Hidden Variable Encoding
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraint Processing
New Tractable Classes From Old
Constraints
CORDS: automatic discovery of correlations and soft functional dependencies
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Robust query processing through progressive optimization
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Backjump-Based Techniques versus Conflict-Directed Heuristics
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Towards a robust query optimizer: a principled and practical approach
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Theory of Relational Databases
Theory of Relational Databases
Domain filtering consistencies
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results
Journal of Artificial Intelligence Research
Constraint and variable ordering heuristics for compiling configuration problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Look-ahead value ordering for constraint satisfaction problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Refining the basic constraint propagation algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Making AC-3 an optimal algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Discrete Optimization by Relational Constraint Satisfaction
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimization of Simple Tabular Reduction for Table Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A new method for solving interval and fuzzy equations: Linear case
Information Sciences: an International Journal
Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Journal of Experimental Algorithmics (JEA)
Maintaining Arc Consistency in Non-Binary Dynamic CSPs using Simple Tabular Reduction
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Propagating soft table constraints
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
An optimal filtering algorithm for table constraints
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Extending simple tabular reduction with short supports
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.07 |
Previous algorithms for unrestricted constraint satisfaction use reduction search, which inferentially removes values from domains in order to prune the backtrack search tree. This paper introduces partition search, which uses an efficient join mechanism instead of removing values from domains. Analytical prediction of quantitative performance of partition search appears to be intractable and evaluation therefore has to be by experimental comparison with reduction search algorithms that represent the state of the art. Instead of working only with available reduction search algorithms, this paper introduces enhancements such as semijoin reduction preprocessing using Bloom filtering.