Sciweavers

2514 search results - page 112 / 503
» On the Computation of Approximations of Database Queries
Sort
View
PODS
2009
ACM
229views Database» more  PODS 2009»
16 years 7 months ago
Computing all skyline probabilities for uncertain data
Skyline computation is widely used in multi-criteria decision making. As research in uncertain databases draws increasing attention, skyline queries with uncertain data have also ...
Mikhail J. Atallah, Yinian Qi
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
16 years 6 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
NCA
2009
IEEE
16 years 1 months ago
Sharing Private Information Across Distributed Databases
—In industries such as healthcare, there is a need to electronically share privacy-sensitive data across distinct organizations. We show how this can be done while allowing organ...
Michael Siegenthaler, Ken Birman
ICDE
2011
IEEE
207views Database» more  ICDE 2011»
14 years 10 months ago
Monte Carlo query processing of uncertain multidimensional array data
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...
Tingjian Ge, David Grabiner, Stanley B. Zdonik
POPL
2007
ACM
16 years 6 months ago
Extracting queries by static analysis of transparent persistence
Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent da...
Ben Wiedermann, William R. Cook