Sciweavers

721 search results - page 9 / 145
» Supporting top-k join queries in relational databases
Sort
View
FOCS
2008
IEEE
15 years 4 months ago
Size Bounds and Query Plans for Relational Joins
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
Albert Atserias, Martin Grohe, Dániel Marx
CIKM
2009
Springer
15 years 4 months ago
Bitmap indexes for relational XML twig query processing
Due to an increasing volume of XML data, it is considered prudent to store XML data on an industry-strength database system instead of relying on a domain specific application or...
Kyong-Ha Lee, Bongki Moon
VLDB
1999
ACM
127views Database» more  VLDB 1999»
15 years 1 months ago
Evaluating Top-k Selection Queries
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typical...
Surajit Chaudhuri, Luis Gravano
DEXA
2003
Springer
193views Database» more  DEXA 2003»
15 years 2 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. 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 t...
Christian Böhm, Florian Krebs
172
Voted
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
15 years 11 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...