Sciweavers

6974 search results - page 278 / 1395
» Querying Semi-Structured Data
Sort
View
VLDB
1998
ACM
87views Database» more  VLDB 1998»
15 years 11 months ago
Fast High-Dimensional Data Search in Incomplete Databases
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...
Beng Chin Ooi, Cheng Hian Goh, Kian-Lee Tan
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
14 years 2 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
16 years 8 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
SIGMOD
2004
ACM
161views Database» more  SIGMOD 2004»
16 years 6 months ago
Approximation Techniques for Spatial Data
Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high ...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 6 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul