Sciweavers

390 search results - page 24 / 78
» Approximate Query Answering in Locally Closed Databases
Sort
View
FOCS
2009
IEEE
15 years 4 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
15 years 11 months ago
Convoy Queries in Spatio-Temporal Databases
We introduce a convoy query that retrieves all convoys from historical trajectories, each of which consists of a set of objects that travelled closely during a certain time period....
Hoyoung Jeung, Heng Tao Shen, Xiaofang Zhou
LPNMR
2005
Springer
15 years 3 months ago
An ID-Logic Formalization of the Composition of Autonomous Databases
We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitio...
Bert Van Nuffelen, Ofer Arieli, Alvaro Corté...
DBISP2P
2003
Springer
70views Database» more  DBISP2P 2003»
15 years 3 months ago
A Robust Logical and Computational Characterisation of Peer-to-Peer Database Systems
In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p sys...
Enrico Franconi, Gabriel M. Kuper, Andrei Lopatenk...
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
14 years 11 months ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi