Sciweavers

PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 4 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
PODS
2006
ACM
156views Database» more  PODS 2006»
14 years 4 months ago
From statistical knowledge bases to degrees of belief: an overview
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. ...
Joseph Y. Halpern
PODS
2006
ACM
132views Database» more  PODS 2006»
14 years 4 months ago
Principles of dataspace systems
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...
Alon Y. Halevy, Michael J. Franklin, David Maier
PODS
2006
ACM
88views Database» more  PODS 2006»
14 years 4 months ago
Structural characterizations of the semantics of XPath as navigation tool on a document
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of various fragments of XPath, the core navigational language on XML documents. We gi...
Marc Gyssens, Jan Paredaens, Dirk Van Gucht, Georg...
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 4 months ago
Approximate quantiles and the order of the stream
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...
Sudipto Guha, Andrew McGregor
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 4 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
PODS
2006
ACM
104views Database» more  PODS 2006»
14 years 4 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei
PODS
2006
ACM
137views Database» more  PODS 2006»
14 years 4 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
PODS
2006
ACM
107views Database» more  PODS 2006»
14 years 4 months ago
Programmable clustering
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar
PODS
2006
ACM
107views Database» more  PODS 2006»
14 years 4 months ago
Asking the right questions: model-driven optimization using probes
Ashish Goel, Sudipto Guha, Kamesh Munagala