XRel

Yoshikawa, Masatoshi; Amagasa, Toshiyuki; Shimura, Takeyuki; Uemura, Shunsuke

doi:10.1145/383034.383038

Cited by 310 publications

(175 citation statements)

References 14 publications

Supporting

Mentioning

175

Contrasting

Order By: Relevance

“…The XRel approach [37] is another path-based approach. The main difference here is that for each element, the path id corresponding to the root-to-leaf path as well as an interval representing the region covered by the element are stored.…”

Section: Relational Schema Designmentioning

confidence: 99%

XML-to-SQL Query Translation Literature: The State of the Art and Open Problems

Krishnamurthy

Kaushik

Naughton

2003

Database and XML Technologies

View full text Add to dashboard Cite

Abstract. Recently, the database research literature has seen an explosion of publications with the goal of using an RDBMS to store and/or query XML data. The problems addressed and solved in this area are diverse. This diversity renders it difficult to know how the various results presented fit together, and even makes it hard to know what open problems remain. As a first step to rectifying this situation, we present a classification of the problem space and discuss how almost 40 papers fit into this classification. As a result of this study, we find that some basic questions are still open. In particular, for the XML publishing of relational data and for "schema-based" shredding of XML documents into relations, there is no published algorithm for translating even simple path expression queries (with the // axis) into SQL when the XML schema is recursive.

show abstract

Section: Relational Schema Designmentioning

confidence: 99%

XML-to-SQL Query Translation Literature: The State of the Art and Open Problems

Krishnamurthy

Kaushik

Naughton

2003

Database and XML Technologies

View full text Add to dashboard Cite

show abstract

“…[25] proposes a DTD-independent, path-based mapping algorithm. While ignoring specific characteristics hidden in each DTD, [25] decomposes XML documents into element, attribute, text and path tables, so that the changes of DTDs of the XML documents do not necessarily result in invalid mapping as found in examples [8,22].…”

Section: Data-based Conversionsmentioning

confidence: 99%

“…Recently many conversion algorithms have been proposed (e.g., [8,22,10,25]), each of which has different pros and cons for different applications. When the schema-level access control is specified, for instance, we believe the path-based conversion methods such as XRel [25] are good candidates. This is because in XML model, using XPath to specify the scope of the objects is quite natural.…”

Section: Xml To Relational Conversionmentioning

confidence: 99%

“…Also, the rule R4 states that "Manager can read/write the Budget element under the Proj element when the Proj has a private as a value for the attribute type." Now, suppose the XML document in Table 3 is converted and stored in relational databases using XRel method [25] as shown in Table 5. Note that what is shown in Table 5 is a simplified version of the original XRel algorithm for simplicity.…”

Section: Illustrative Examplementioning

confidence: 99%

See 1 more Smart Citation

Supporting XML Security Models Using Relational Databases: A Vision

Lee

Liu

2003

Database and XML Technologies

View full text Add to dashboard Cite

Abstract. As the secure distribution and sharing of information over the World Wide Web becomes increasingly important, the needs for flexible and efficient support of access control systems naturally arise. Since the eXtensible Markup Language (XML) is emerging as the format of the Internet era for storing and exchanging information, there have been, recently, many proposals to extend the XML model to incorporate security aspects. To the lesser or greater extent, however, such proposals neglect the fact that the data for XML documents will most likely reside in relational databases, and consequently do not utilize various security models proposed for and implemented in relational databases. In this paper, we take a rather different approach. We explore how to support security models for XML documents by leveraging on techniques developed for relational databases. More specifically, in our approach, (1) Users make XML queries against the given XML view/schema, (2) Access controls for XML data are also specified in the XML model, but (3) Data are stored in relational databases, and (4) Security check and query evaluation are also done in relational databases. Instead of re-inventing wheels, we take two representative methods in both XML security model and XML to relational conversion problems, and show how to glue them together in a seamless manner to efficiently support access controls for the XML model using relational databases.

show abstract

“…We use the range-based static labeling scheme [13] to label the nodes of an XML tree. The scheme initializes a counter to one and carries out a depth-first traversal of the XML tree.…”

Section: Publish Algorithmmentioning

confidence: 99%

An XML Publish/Subscribe Algorithm Implemented by Relational Operators

Zhao

Yang

Gao

et al.

Advances in Data and Web Management

View full text Add to dashboard Cite

Abstract. An XML publish/subscribe algorithm needs to store large numbers of XPath or XQuery subscriptions and match subscriptions with published XML documents. Since the number of the subscriptions may be very large, the performance and the scalability of the algorithm may be critical. The scalability of the method of constructing a large finite state automata or decision tree for all subscriptions is limited by amount of available physical memory. In this paper, we will introduce an XML publish/subscribe algorithm which is consisted of the publish algorithm, subscribe algorithm, and matching algorithm. The matching algorithm uses relational operators to match subscriptions with publications inside a relational database, so the scalability of the algorithm is no longer limited by amount of available physical memory. Experimental results show that the matching algorithm has very good performance and scalability.

show abstract

XRel

Cited by 310 publications

References 14 publications

XML-to-SQL Query Translation Literature: The State of the Art and Open Problems

XML-to-SQL Query Translation Literature: The State of the Art and Open Problems

Supporting XML Security Models Using Relational Databases: A Vision

An XML Publish/Subscribe Algorithm Implemented by Relational Operators

Contact Info

Product

Resources

About