Optimization of control parameters for genetic algorithms
IEEE Transactions on Systems, Man and Cybernetics
Iconic indexing by 2-D strings
IEEE Transactions on Pattern Analysis and Machine Intelligence
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
Artificial Intelligence
Processing and optimization of multiway spatial joins using R-trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Integration of spatial join algorithms for processing multiple inputs
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Content-based retrieval using heuristic search
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Similarity Searching in Medical Image Databases
IEEE Transactions on Knowledge and Data Engineering
Cost Models for Join Queries in Spatial Databases
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
On Multi-way Spatial Joins with Direction Predicates
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Multi-Way Distance Join Queries in Spatial Databases
Geoinformatica
Accelerating approximate similarity queries using genetic algorithms
Proceedings of the 2005 ACM symposium on Applied computing
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Topological operators: a relaxed query processing approach
Geoinformatica
Processing multi-way spatial joins on map-reduce
Proceedings of the 16th International Conference on Extending Database Technology
| Hi-index | 0.00 |
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however, exhaustive processing of multiway spatial joins can be prohibitively expensive due to the exponential nature of the problem. Furthermore, if there do not exist any exact solutions, the result will be empty even though there may exist solutions that match the query very closely. These shortcomings motivate the current work, which aims at the retrieval of the best possible (exact or approximate) solutions within a time threshold, since fast retrieval of approximate matches is the only way to deal with the ever increasing amounts of multimedia information in several real time systems. We propose various techniques that combine local and evolutionary search with underlying indexes to prune the search space. In addition to their usefulness as standalone methods for approximate query processing, the techniques can be combined with systematic search to enhance performance when the goal is retrieval of the best solutions.