Sciweavers

1038 search results - page 31 / 208
» Space-Bounded Query Approximation
Sort
View
IS
2008
14 years 11 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
PODS
2000
ACM
102views Database» more  PODS 2000»
15 years 4 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
SAGA
2007
Springer
15 years 5 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...
ICDE
2004
IEEE
144views Database» more  ICDE 2004»
16 years 1 months ago
Spatio-Temporal Aggregation Using Sketches
Several spatio-temporal applications require the retrieval of summarized information about moving objects that lie in a query region during a query interval (e.g., the number of m...
Yufei Tao, George Kollios, Jeffrey Considine, Feif...
ICEIS
2009
IEEE
15 years 6 months ago
Relaxing XML Preference Queries for Cooperative Retrieval
Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been ...
SungRan Cho, Wolf-Tilo Balke