Sciweavers

59 search results - page 5 / 12
» Rewriting Unions of General Conjunctive Queries Using Views
Sort
View
SIS
2007
13 years 8 months ago
A General Approach to Securely Querying XML
Access control models for XML data can be classified in two major categories: node filtering and query rewriting systems. The first category includes approaches that use access ...
Ernesto Damiani, Majirus Fansi, Alban Gabillon, St...
ICDT
2003
ACM
139views Database» more  ICDT 2003»
14 years 20 days ago
New Rewritings and Optimizations for Regular Path Queries
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those r...
Gösta Grahne, Alex Thomo
DBPL
2001
Springer
115views Database» more  DBPL 2001»
13 years 12 months ago
Optimization Properties for Classes of Conjunctive Regular Path Queries
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
Alin Deutsch, Val Tannen
EDBT
2008
ACM
162views Database» more  EDBT 2008»
14 years 7 months ago
Schema merging and mapping creation for relational sources
We address the problem of generating a mediated schema from a set of relational data source schemas and conjunctive queries that specify where those schemas overlap. Unlike past a...
Rachel Pottinger, Philip A. Bernstein
VLDB
2001
ACM
157views Database» more  VLDB 2001»
14 years 7 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy