Sciweavers

3652 search results - page 309 / 731
» A study of query length
Sort
View
110
Voted
SAGA
2007
Springer
15 years 9 months ago
Approximate Discovery of Random Graphs
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
Thomas Erlebach, Alexander Hall, Matús Miha...
112
Voted
FOCS
2003
IEEE
15 years 9 months ago
On the Implementation of Huge Random Objects
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
Oded Goldreich, Shafi Goldwasser, Asaf Nussboim
221
Voted
PODS
2010
ACM
207views Database» more  PODS 2010»
15 years 8 months ago
Understanding cardinality estimation using entropy maximization
Cardinality estimation is the problem of estimating the number of tuples returned by a query; it is a fundamentally important task in data management, used in query optimization, ...
Christopher Ré, Dan Suciu
114
Voted
PODS
2000
ACM
102views Database» more  PODS 2000»
15 years 8 months ago
Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
Floris Geerts, Bart Kuijpers
139
Voted
PODS
2000
ACM
112views Database» more  PODS 2000»
15 years 8 months ago
Auditing Boolean Attributes
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensit...
Jon M. Kleinberg, Christos H. Papadimitriou, Prabh...