Sciweavers

625 search results - page 7 / 125
» Genetic algorithms for large join query optimization
Sort
View
GIS
2006
ACM
14 years 8 months ago
Query optimizer for spatial join operations
This paper presents a query optimizer module based on cost estimation that chooses the best filtering step algorithm to perform a specific spatial join operation. A set of express...
Cirano Iochpe, João Luiz Dihl Comba, Miguel...
CIKM
2005
Springer
14 years 1 months ago
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
Neoklis Polyzotis
CIKM
1994
Springer
13 years 11 months ago
TID Hash Joins
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
Robert Marek, Erhard Rahm
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
14 years 17 days ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
12 years 11 months ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge