103 search results - page 13 / 21 » Efficient Indexing Methods for Probabilistic Threshold Queri... |
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of pro...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
The skyline query returns the most interesting tuples according to a set of explicitly defined preferences among attribute values. This work relaxes this requirement, and allows us...
EDBT
2010
ACM
14 years 2 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
DEXA
2004
Springer
14 years 28 days ago
2004
Springer
Efficient storage and retrieval of trajectory indexes has become an essential requirement for moving objects databases. The existing 3DR-tree is known to be an effective trajectory...