294 search results - page 11 / 59 » Answering Regular Path Queries Using Views |
SIGMOD
2001
ACM
14 years 8 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
ADBIS
2000
Springer
14 years 24 days ago
2000
Springer
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
JIIS
2008
13 years 8 months ago
2008
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...