Sciweavers

627 search results - page 28 / 126
» Efficient Top-k Query Evaluation on Probabilistic Data
Sort
View
EDBT
2010
ACM
137views Database» more  EDBT 2010»
15 years 25 days ago
Fine-grained and efficient lineage querying of collection-based workflow provenance
The management and querying of workflow provenance data underpins a collection of activities, including the analysis of workflow results, and the debugging of workflows or service...
Paolo Missier, Norman W. Paton, Khalid Belhajjame
195
Voted
PODS
2009
ACM
229views Database» more  PODS 2009»
15 years 10 months ago
Computing all skyline probabilities for uncertain data
Skyline computation is widely used in multi-criteria decision making. As research in uncertain databases draws increasing attention, skyline queries with uncertain data have also ...
Mikhail J. Atallah, Yinian Qi
166
Voted
GIS
2007
ACM
15 years 10 months ago
TS2-tree - an efficient similarity based organization for trajectory data
The increasingly popular GPS technology and the growing amount of trajectory data it generates create the need for developing applications that efficiently store and query traject...
Petko Bakalov, Eamonn J. Keogh, Vassilis J. Tsotra...
70
Voted
VLDB
1997
ACM
86views Database» more  VLDB 1997»
15 years 1 months ago
Using Probabilistic Information in Data Integration
The goal of a mediator system is to provide users a uniform interface to the multitude of information sources. To translate user queries, given in a mediated schema, to queries on...
Daniela Florescu, Daphne Koller, Alon Y. Levy
WWW
2008
ACM
15 years 10 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...