Sciweavers

721 search results - page 13 / 145
» Supporting top-k join queries in relational databases
Sort
View
VLDB
1999
ACM
107views Database» more  VLDB 1999»
15 years 1 months ago
The Value of Merge-Join and Hash-Join in SQL Server
Microsoft SQL Server was successful for many years for transaction processing and decision support workloads with neither merge join nor hash join, relying entirely on nested loop...
Goetz Graefe
SSD
1999
Springer
97views Database» more  SSD 1999»
15 years 1 months ago
A Performance Evaluation of Spatial Join Processing Strategies
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...
Apostolos Papadopoulos, Philippe Rigaux, Michel Sc...
WIDM
2005
ACM
15 years 3 months ago
Exploiting native XML indexing techniques for XML retrieval in relational database systems
In XML retrieval, two distinct approaches have been established and pursued without much cross-fertilization taking place so far. On the one hand, native XML databases tailored to...
Felix Weigel, Klaus U. Schulz, Holger Meuss
EDBT
1994
ACM
149views Database» more  EDBT 1994»
15 years 1 months ago
On the Estimation of Join Result Sizes
Abstract. Good estimates of join result sizes are critical for query optimization in relational database management systems. We address the problem of incrementally obtaining accur...
Arun N. Swami, K. Bernhard Schiefer
ODBIS
2007
Springer
150views Database» more  ODBIS 2007»
15 years 3 months ago
An Effective SPARQL Support over Relational Databases
Supporting SPARQL queries over relational databases becomes an active topic recently. However, it has not received enough consideration when SPARQL queries include restrictions on...
Jing Lu, Feng Cao, Li Ma, Yong Yu, Yue Pan