Sciweavers

211 search results - page 9 / 43
» Ranked Query Processing in Uncertain Databases
Sort
View
SIGMOD
2005
ACM
164views Database» more  SIGMOD 2005»
14 years 7 months ago
RankSQL: Query Algebra and Optimization for Relational Top-k Queries
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database syst...
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas...
EDBT
2009
ACM
174views Database» more  EDBT 2009»
14 years 2 months ago
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...
Goce Trajcevski, Roberto Tamassia, Hui Ding, Peter...
IS
2007
13 years 7 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...
ICEIS
2002
IEEE
14 years 14 days ago
Managing Uncertain Trajectories of Moving Objects with Domino
: This work describes the features of the DOMINO (Database fOr MovINg Objects) system, which brings several novelties to the problem of managing moving objects databases. Our robus...
Goce Trajcevski, Ouri Wolfson, Hu Cao, Hai Lin, Fe...
BTW
2007
Springer
131views Database» more  BTW 2007»
13 years 11 months ago
TopX - Efficient and Versatile Top-k Query Process-ing for Text, Semistructured, and Structured Data
: This paper presents a comprehensive overview of the TopX search engine, an extensive framework for unified indexing and querying large collections of unstructured, semistructured...
Martin Theobald, Ralf Schenkel, Gerhard Weikum