1778 search results - page 288 / 356 » The Theory of Probabilistic Databases |
PODS
2010
ACM
15 years 3 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
ALT
2000
Springer
15 years 2 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
115
click to vote
PODS
1994
ACM
15 years 2 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
104
click to vote
CF
2007
ACM
15 years 2 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
CVPR
2010
IEEE
14 years 10 months ago
2010
IEEE
Shape database search is ubiquitous in the world of biometric systems, CAD systems etc. Shape data in these domains is experiencing an explosive growth and usually requires search...