Sciweavers

721 search results - page 29 / 145
» Supporting top-k join queries in relational databases
Sort
View
WISE
2003
Springer
15 years 2 months ago
Publishing and Querying the Histories of Archived Relational Databases in XML
There is much current interest in publishing and viewing databases as XML documents. The general benefits of this approach follow from the popularity of XML and the tool set avai...
Fusheng Wang, Carlo Zaniolo
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
15 years 11 months ago
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
Lin Guo, Jayavel Shanmugasundaram, Kevin S. Beyer,...
EDBT
2006
ACM
150views Database» more  EDBT 2006»
15 years 9 months ago
Improving the Efficiency of XPath Execution on Relational Systems
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
Haris Georgiadis, Vasilis Vassalos
ICDE
2008
IEEE
140views Database» more  ICDE 2008»
15 years 11 months ago
Top-k Spatial Joins of Probabilistic Objects
Probabilistic data have recently become popular in applications such as scientific and geospatial databases. For images and other spatial datasets, probabilistic values can capture...
Vebjorn Ljosa, Ambuj K. Singh
SIGMOD
2011
ACM
179views Database» more  SIGMOD 2011»
14 years 15 days ago
How soccer players would do stream joins
In spite of the omnipresence of parallel (multi-core) systems, the predominant strategy to evaluate window-based stream joins is still strictly sequential, mostly just straightfor...
Jens Teubner, René Müller