Proceedings 14th International Conference on Data Engineering
DOI: 10.1109/icde.1998.655753
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing regular path expressions using graph schemas

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
123
0

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 162 publications
(123 citation statements)
references
References 18 publications
0
123
0
Order By: Relevance
“…At the logical level, the XML query optimization is to utilize the XML Schema, and to apply the rules of normalization or simplification to the inner query expressions so as to simplify the expressions that can improve the query performance. Lots of researches focusing on logical optimization have been done [3,4,5,6,7,9,10]. Our work focuses on the cost-based query optimization at the physical level and deals with how to determine the join order in query trees according to the cost estimation.…”
Section: Related Workmentioning
confidence: 99%
“…At the logical level, the XML query optimization is to utilize the XML Schema, and to apply the rules of normalization or simplification to the inner query expressions so as to simplify the expressions that can improve the query performance. Lots of researches focusing on logical optimization have been done [3,4,5,6,7,9,10]. Our work focuses on the cost-based query optimization at the physical level and deals with how to determine the join order in query trees according to the cost estimation.…”
Section: Related Workmentioning
confidence: 99%
“…As mentioned in Section 2, the absence of source subelement in a news element would filter out this news while the absence of keyword would not. Furthermore, we apply type inference [3] on the query trees so that nondeterministic navigation steps such as "//" or "*" are resolved as much as possible.…”
Section: Uniform Modelingmentioning
confidence: 99%
“…Schema knowledge is used to rewrite a query into a more efficient one. Most current literature on SQOs in XML focuses on techniques that are either (1) general regardless of persistent or streaming XML sources [1] or (2) specific to persistent XML sources [3]. For example, query tree minimization [1] is a general technique.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Our embedding relation closely resembles the notion of simulation (for the formal definition, see [2]), which has been widely used in a number of works about querying, transformation, and verification of semistructured data (cf. [6,1,15,5] It is important to have an efficient implementation of homeomorphic embedding because it is used repeatedly during the verification process as described in the following.…”
Section: Rule-based Web Site Verificationmentioning
confidence: 99%