44 search results - page 4 / 9 » Algebraic Rewritings for Optimizing Regular Path Queries |
ADL
2000
Springer
13 years 11 months ago
2000
Springer
We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful that the XML DTDs and is clo...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
Most declarative SQL-like query languagesfor object-oriented database systems (OOSQL) are orthogonal languages allowing for arbitrary nesting of expressions in the select-, from-,...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
Consider an XML view defined over a relational database, and a user query specified over this view. This user XML query is typically processed using the following steps: (a) our t...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
As XQuery nears standardization, more sophisticated XQuery applications are emerging, which often exploit the entire language and are applied to non-trivial XML sources. We propos...