Sciweavers

103 search results - page 12 / 21
» Efficient Indexing Methods for Probabilistic Threshold Queri...
Sort
View
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
14 years 9 months ago
Representing and Querying Correlated Tuples in Probabilistic Databases
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of pr...
Prithviraj Sen, Amol Deshpande
IJOCI
2010
163views more  IJOCI 2010»
13 years 4 months ago
An Experimental Performance Comparison for Indexing Mobile Objects on the Plane
We present a time-efficient approach to index objects moving on the plane to efficiently answer range queries about their future positions. Each object is moving with non small ve...
Spyros Sioutas, George Papaloukopoulos, Kostas Tsi...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
JUCS
2007
122views more  JUCS 2007»
13 years 7 months ago
Efficient Access Methods for Temporal Interval Queries of Video Metadata
: Indexing video content is one of the most important problems in video databases. In this paper we present linear time and space algorithms for handling video metadata that repres...
Spyros Sioutas, Kostas Tsichlas, Bill Vassiliadis,...
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
14 years 7 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan