627 search results - page 14 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
92
Voted
SSDBM
2007
IEEE
15 years 3 months ago
2007
IEEE
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...
165
click to vote
ICDE
2006
IEEE
15 years 10 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
JISE
2007
14 years 9 months ago
2007
TKDE
2008
14 years 9 months ago
2008
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
EDBT
2010
ACM
15 years 4 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...