Sciweavers

186 search results - page 26 / 38
» A Practical Approach to Hypothetical Database Queries
Sort
View
144
Voted
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
15 years 10 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...
140
Voted
VLDB
2004
ACM
120views Database» more  VLDB 2004»
15 years 9 months ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...
173
Voted
PODS
2008
ACM
174views Database» more  PODS 2008»
16 years 3 months ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...
168
Voted
CIKM
2010
Springer
15 years 1 months ago
Automatic schema merging using mapping constraints among incomplete sources
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
Xiang Li 0002, Christoph Quix, David Kensche, Sand...
128
Voted
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 3 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin