S. A1-Khalifa, H.V. Jagadish, N. Koudas, J.M. Patel, D. Srivastava, Y. Wu. Structural joins: A primitive for efficient XML query pattern matching. In Proc. of the IEEE Int'l Conf. on Data Engineering, 141452, 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Distributing XML Repositories - Bremer, Gertz (2003) (Correct)
....Figure 3. Location Location I . parent Books Books Id selection II node . II ancestor . II I , descendant L Zurich Path Pattern Tree Pattern Figure 1: Path and tree pattern queries The most common approach to process path and tree pat tern queries are structural joins (e.g. [2, 9, 15]) Structural joins (SJs) are based on index structures that store lists of logical identifers for nodes in a source. Each list is related to a certain node predicate, which is a common node label or label path, or a word occurrence. Node identifers allow a query engine to determine parent child ....
....path, or a word occurrence. Node identifers allow a query engine to determine parent child and ancestordescendant relationships between nodes. This in turn allows for reassembling instances of the full pattern as they occur in a source by joining node id lists, which represent atomic patterns [2]. 3. DISTRIBUTION DESIGN The objective of the distribution design for an XML repository is to formally describe what and how XML repository data is fragmented and allocated at local sites. Although the design strategy follows basic distribution principles known for relational and object oriented ....
[Article contains additional citation context not shown here]
S. A1-Khalifa, H.V. Jagadish, N. Koudas, J.M. Patel, D. Srivastava, Y. Wu. Structural joins: A primitive for efficient XML query pattern matching. In Proc. of the IEEE Int'l Conf. on Data Engineering, 141452, 2002.
Efficient Structural Joins on Indexed XML Documents - Chien, Vagena, Zhang.. (2002) (8 citations) (Correct)
....that are children of section elements (i.e. a parent child relationship) Traditional indexing schemes, such as B trees, can be easily extended to support value based queries on XML documents. Path expression queries pose a much harder problem, requiring the computation of struc tural joins [1, 24]. Previously proposed structural join algorithms assume that the ancestor and the descendant elements are provided before the join in two or dered lists [1, 24] However, that implies that all ances tor and descendant elements are accessed either from indices or even from physical data pages ....
....value based queries on XML documents. Path expression queries pose a much harder problem, requiring the computation of struc tural joins [1, 24] Previously proposed structural join algorithms assume that the ancestor and the descendant elements are provided before the join in two or dered lists [1, 24]. However, that implies that all ances tor and descendant elements are accessed either from indices or even from physical data pages before the join. That may cause unnecessary I O and slow down the join process. Instead we assume that an index exists in each of the joined lists. Typically, list ....
[Article contains additional citation context not shown here]
S. A1-Khalifa, H. V. Jagadish, N. Koudas, J. M. Patel, D. Srivastava and Y. Wu, "Structural Joins: A Primitive for Efficient XML Query Pattern Matching", Proc. of ICDE, 2002.
Optimizing the Secure Evaluation of Twig Queries - Cho, Lakshmanan, Amer-Yahia, .. (2002) (4 citations) Self-citation (Srivastava) (Correct)
....of query access to XML (see, e.g. 7, 6] there has been no work on enforcement of access control policies for the case of XML query access. A naive two step approach to secure XML query evaluation is: i) compute the query result using existing XML query processing techniques (see, e.g. [13, 16, 8, 1]) and (ii) filter the query results, using the ac cess control policies, in a post processing step. While this approach may appear attractive, it is not secure. For example, consider the XML database of an online seller (the DTD is illustrated in Figure 1) which has information about books and ....
S. A1-Khalifa, H. V. Jagadish, N. Koudas, J. M. Patel, D. Srivastava, and Y. Wu. Structural joins: A primitive for efficient XML query pattern matching. In IrCDE, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC