Sciweavers

1042 search results - page 10 / 209
» Constraint Databases, Data Structures and Efficient Query Ev...
Sort
View
DASFAA
2010
IEEE
176views Database» more  DASFAA 2010»
13 years 7 months ago
Efficient Database-Driven Evaluation of Security Clearance for Federated Access Control of Dynamic XML Documents
Achieving data security over cooperating web services is becoming a reality, but existing XML access control architectures do not consider this federated service computing. In this...
Erwin Leonardi, Sourav S. Bhowmick, Mizuho Iwaihar...
STACS
2010
Springer
14 years 2 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu
SIGMOD
2007
ACM
176views Database» more  SIGMOD 2007»
14 years 7 months ago
URank: formulation and efficient evaluation of top-k queries in uncertain databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...
EDBT
2004
ACM
162views Database» more  EDBT 2004»
14 years 7 months ago
Non-contiguous Sequence Pattern Queries
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
Nikos Mamoulis, Man Lung Yiu