Sciweavers

6974 search results - page 10 / 1395
» Querying Semi-Structured Data
Sort
View
JDCTA
2010
151views more  JDCTA 2010»
13 years 2 months ago
Research on Querying Node Probability Method in Probabilistic XML Data Based on Possible World
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
Jianwei Wang, Zhongxiao Hao
PVLDB
2010
111views more  PVLDB 2010»
13 years 2 months ago
PolicyReplay: Misconfiguration-Response Queries for Data Breach Reporting
Recent legislation has increased the requirements of organizations to report data breaches, or unauthorized access to data. While access control policies are used to restrict acce...
Daniel Fabbri, Kristen LeFevre, Qiang Zhu
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 2 months ago
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. La...
SIAMCOMP
2012
11 years 10 months ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
12 years 11 months ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge