Sciweavers

627 search results - page 13 / 126
» Efficient Top-k Query Evaluation on Probabilistic Data
Sort
View
EDBT
2004
ACM
147views Database» more  EDBT 2004»
15 years 9 months ago
Efficient Query Evaluation over Compressed XML Data
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
15 years 9 months ago
Ranking queries on uncertain data: a probabilistic threshold approach
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
ICDE
2006
IEEE
193views Database» more  ICDE 2006»
15 years 10 months ago
Probabilistic Message Passing in Peer Data Management Systems
Until recently, most data integration techniques involved central components, e.g., global schemas, to enable transparent access to heterogeneous databases. Today, however, with t...
Philippe Cudré-Mauroux, Karl Aberer, Andras...
EDBT
2009
ACM
207views Database» more  EDBT 2009»
15 years 21 days ago
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
Reynold Cheng, Lei Chen 0002, Jinchuan Chen, Xike ...
SSDBM
2008
IEEE
149views Database» more  SSDBM 2008»
15 years 3 months ago
Query Planning for Searching Inter-dependent Deep-Web Databases
Increasingly, many data sources appear as online databases, hidden behind query forms, thus forming what is referred to as the deep web. It is desirable to have systems that can pr...
Fan Wang, Gagan Agrawal, Ruoming Jin