Sciweavers

613 search results - page 34 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
SIGMOD
1998
ACM
180views Database» more  SIGMOD 1998»
15 years 6 months ago
Integration of Heterogeneous Databases Without Common Domains Using Queries Based on Textual Similarity
Most databases contain “name constants” like course numbers, personal names, and place names that correspond to entities in the real world. Previous work in integration of het...
William W. Cohen
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
13 years 4 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
GIS
2006
ACM
16 years 3 months ago
On-line maintenance of simplified weighted graphs for efficient distance queries
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...
Floris Geerts, Peter Z. Revesz, Jan Van den Bussch...
DEXA
2009
Springer
153views Database» more  DEXA 2009»
15 years 5 months ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
15 years 8 months ago
Derby/S: a DBMS for sample-based query answering
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
Anja Klein, Rainer Gemulla, Philipp Rösch, Wo...