Sciweavers

62 search results - page 6 / 13
» Query rewriting with symmetric constraints
Sort
View
ICDT
2009
ACM
119views Database» more  ICDT 2009»
15 years 10 months ago
Querying data sources that export infinite sets of views
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
Bogdan Cautis, Alin Deutsch, Nicola Onose
ICDE
2006
IEEE
179views Database» more  ICDE 2006»
15 years 11 months ago
ACXESS - Access Control for XML with Enhanced Security Specifications
We present ACXESS (Access Control for XML with Enhanced Security Specifications), a system for specifying and enforcing enhanced security constraints on XML via virtual "secu...
Sriram Mohan, Jonathan Klinginsmith, Arijit Sengup...
DBSEC
2006
122views Database» more  DBSEC 2006»
14 years 11 months ago
Term Rewriting for Access Control
We demonstrate how access control models and policies can be represented by using term rewriting systems, and how rewriting may be used for evaluating access requests and for provi...
Steve Barker, Maribel Fernández
VLDB
1999
ACM
89views Database» more  VLDB 1999»
15 years 1 months ago
Physical Data Independence, Constraints, and Optimization with Universal Plans
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
Alin Deutsch, Lucian Popa, Val Tannen
VLDB
2001
ACM
151views Database» more  VLDB 2001»
15 years 9 months ago
Approximate query mapping: Accounting for translation closeness
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
Kevin Chen-Chuan Chang, Hector Garcia-Molina