154 search results - page 5 / 31 » Verifying Completeness of Relational Query Results in Data P... |
DBSEC
2003
13 years 9 months ago
2003
Abstract Data integrity can be problematic when integrating and organizing information from many sources. In this paper we describe efficient mechanisms that enable a group of data...
ICDT
2003
ACM
14 years 23 days ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
WAIM
2004
Springer
14 years 27 days ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
AMW
2010
13 years 9 months ago
2010
We study query authentication schemes, algorithmic and cryptographic constructions that provide efficient and secure protocols for verifying the results of queries over structured...
SIGMOD
1999
ACM
13 years 12 months ago
1999
ACM
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set ...