Sciweavers

296 search results - page 1 / 60
» Top-k queries on temporal data
Sort
View
VLDB
2007
ACM
229views Database» more  VLDB 2007»
14 years 1 months ago
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...
ISAAC
2007
Springer
118views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Dynamic Structures for Top- k Queries on Uncertain Data
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
Jiang Chen, Ke Yi
VLDB
2008
ACM
206views Database» more  VLDB 2008»
14 years 7 months ago
TopX: efficient and versatile top- k query processing for semistructured data
Recent IR extensions to XML query languages
Martin Theobald, Holger Bast, Debapriyo Majumdar, ...
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
14 years 8 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...
WWW
2006
ACM
14 years 8 months ago
A pruning-based approach for supporting Top-K join queries
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
Jie Liu, Liang Feng, Yunpeng Xing