Sciweavers

199 search results - page 6 / 40
» Join queries on uncertain data: Semantics and efficient proc...
Sort
View
PVLDB
2008
146views more  PVLDB 2008»
14 years 9 months ago
Efficient search for the top-k probable nearest neighbors in uncertain databases
Uncertainty pervades many domains in our lives. Current real-life applications, e.g., location tracking using GPS devices or cell phones, multimedia feature extraction, and sensor...
George Beskales, Mohamed A. Soliman, Ihab F. Ilyas
ICDE
2002
IEEE
138views Database» more  ICDE 2002»
15 years 10 months ago
Efficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
Donghui Zhang, Vassilis J. Tsotras, Bernhard Seege...
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
2009
IEEE
156views Database» more  ICDE 2009»
15 years 11 months ago
Integrating and Ranking Uncertain Scientific Data
Mediator-based data integration systems resolve exploratory queries by joining data elements across sources. In the presence of uncertainties, such multiple expansions can quickly ...
Landon Detwiler, Wolfgang Gatterbauer, Brenton Lou...
101
Voted
WWW
2010
ACM
15 years 4 months ago
Matrix "Bit" loaded: a scalable lightweight join query processor for RDF data
The Semantic Web community, until now, has used traditional database systems for the storage and querying of RDF data. The SPARQL query language also closely follows SQL syntax. A...
Medha Atre, Vineet Chaoji, Mohammed J. Zaki, James...