158 search results - page 17 / 32 » Tales From a Pod |
PODS
2006
ACM
15 years 9 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
76
Voted
PODS
2006
ACM
15 years 9 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
PODS
2006
ACM
15 years 9 months ago
2006
ACM
The most acute information management challenges today stem from organizations relying on a large number of diverse, interrelated data sources, but having no means of managing the...
PODS
2007
ACM
15 years 9 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
PODS
2008
ACM
15 years 9 months ago
2008
ACM
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...