55 search results - page 6 / 11 » Cost models for distance joins queries using R-trees |
SIGMOD
2010
ACM
14 years 13 days ago
2010
ACM
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
GEOINFO
2003
13 years 9 months ago
2003
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
IS
2008
13 years 7 months ago
2008
In recent years, while search engines have become more and more powerful, several specialized search engines have been developed for different domains (e.g. library services, serv...
IDEAS
2000
IEEE
14 years 1 hour ago
2000
IEEE
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
EDBT
2012
ACM
11 years 10 months ago
2012
ACM
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...