@inproceedings{ mur07,
  crossref = {xtech2007},
  author = {Ravi Murthy},
  title = {From Trees to Graphs: Evolving XML for Building Enterprise Applications},
  uri = {http://2007.xtech.org/public/schedule/detail/81},
  topic = {xlink[0.7] xinclude[0.7]},
  abstract = {There are many benefits of using XML as the single data model for enterprise applications. In addition to its inherent flexibility and extensibility, it reduces impedance mismatch across tiers and provides opportunity for global dependency analysis and optimization. However, XML is fundamentally a tree data model whereas real world applications truly need graphs. The XML standards provide a few primitive ways of representing relationships (links) between XML nodes, namely ID/IDREF and XLink. But the existing standards require significant enhancements to be able to express declarative constraints (metadata) about links, to configure link behavior, and to easily query/traverse across forward and reverse links. This paper details the requirements and proposes a set of enhancements to XML schema and query languages to enable building enterprise and content management applications. Further, it describes various implementation issues and optimization challenges in managing links within large XML databases. Links between XML nodes can be either intra or inter-document links, and target a fragment (using XPointer) or the entire document. New schema annotations provide declarative mechanisms to constrain the type of the link target, scope the link to a specified domain and also express acyclic link conditions. The integrity of the link wrt to the guaranteed presence of target document and link validity when the target is renamed or moved can also be configured. New query functions enable forward and reverse traversal of links within XPath, XQuery and XSLT. We discuss efficient link storage techniques in XML databases and indexes for performant bidirectional link traversal. In addition to managing links that appear in the original documents, we present mechanisms to implicitly add links into documents. Since a document is the unit of locking, versioning and access control, there are several advantages to decomposing a large XML document into smaller sub documents. Users can declaratively express the decomposition rules using XPaths and/or XML schema annotations. When the document is inserted into the system, it is implicitly shredded into multiple documents, and XInclude link elements are inserted in place of the original fragments. These inter-document links can be managed, queried and traversed as described above. Users can also recompose the original document by invoking native XInclude expansion functions.}
}

{"_id":{"_str":"53ff72c17c90ec6e13001115"},"__v":0,"authorIDs":[],"author_short":["Murthy, R."],"bibbaseid":"murthy-fromtreestographsevolvingxmlforbuildingenterpriseapplications","bibdata":{"downloads":0,"role":"author","bibbaseid":"murthy-fromtreestographsevolvingxmlforbuildingenterpriseapplications","uri":"http://2007.xtech.org/public/schedule/detail/81","type":"inproceedings","topic":"xlink[0.7] xinclude[0.7]","title":"From Trees to Graphs: Evolving XML for Building Enterprise Applications","key":"mur07","id":"mur07","crossref":"xtech2007","bibtype":"inproceedings","bibtex":"@inproceedings{ mur07,\n crossref = {xtech2007},\n author = {Ravi Murthy},\n title = {From Trees to Graphs: Evolving XML for Building Enterprise Applications},\n uri = {http://2007.xtech.org/public/schedule/detail/81},\n topic = {xlink[0.7] xinclude[0.7]},\n abstract = {There are many benefits of using XML as the single data model for enterprise applications. In addition to its inherent flexibility and extensibility, it reduces impedance mismatch across tiers and provides opportunity for global dependency analysis and optimization. However, XML is fundamentally a tree data model whereas real world applications truly need graphs. The XML standards provide a few primitive ways of representing relationships (links) between XML nodes, namely ID/IDREF and XLink. But the existing standards require significant enhancements to be able to express declarative constraints (metadata) about links, to configure link behavior, and to easily query/traverse across forward and reverse links. This paper details the requirements and proposes a set of enhancements to XML schema and query languages to enable building enterprise and content management applications. Further, it describes various implementation issues and optimization challenges in managing links within large XML databases. Links between XML nodes can be either intra or inter-document links, and target a fragment (using XPointer) or the entire document. New schema annotations provide declarative mechanisms to constrain the type of the link target, scope the link to a specified domain and also express acyclic link conditions. The integrity of the link wrt to the guaranteed presence of target document and link validity when the target is renamed or moved can also be configured. New query functions enable forward and reverse traversal of links within XPath, XQuery and XSLT. We discuss efficient link storage techniques in XML databases and indexes for performant bidirectional link traversal. In addition to managing links that appear in the original documents, we present mechanisms to implicitly add links into documents. Since a document is the unit of locking, versioning and access control, there are several advantages to decomposing a large XML document into smaller sub documents. Users can declaratively express the decomposition rules using XPaths and/or XML schema annotations. When the document is inserted into the system, it is implicitly shredded into multiple documents, and XInclude link elements are inserted in place of the original fragments. These inter-document links can be managed, queried and traversed as described above. Users can also recompose the original document by invoking native XInclude expansion functions.}\n}","author_short":["Murthy, R."],"author":["Murthy, Ravi"],"abstract":"There are many benefits of using XML as the single data model for enterprise applications. In addition to its inherent flexibility and extensibility, it reduces impedance mismatch across tiers and provides opportunity for global dependency analysis and optimization. However, XML is fundamentally a tree data model whereas real world applications truly need graphs. The XML standards provide a few primitive ways of representing relationships (links) between XML nodes, namely ID/IDREF and XLink. But the existing standards require significant enhancements to be able to express declarative constraints (metadata) about links, to configure link behavior, and to easily query/traverse across forward and reverse links. This paper details the requirements and proposes a set of enhancements to XML schema and query languages to enable building enterprise and content management applications. Further, it describes various implementation issues and optimization challenges in managing links within large XML databases. Links between XML nodes can be either intra or inter-document links, and target a fragment (using XPointer) or the entire document. New schema annotations provide declarative mechanisms to constrain the type of the link target, scope the link to a specified domain and also express acyclic link conditions. The integrity of the link wrt to the guaranteed presence of target document and link validity when the target is renamed or moved can also be configured. New query functions enable forward and reverse traversal of links within XPath, XQuery and XSLT. We discuss efficient link storage techniques in XML databases and indexes for performant bidirectional link traversal. In addition to managing links that appear in the original documents, we present mechanisms to implicitly add links into documents. Since a document is the unit of locking, versioning and access control, there are several advantages to decomposing a large XML document into smaller sub documents. Users can declaratively express the decomposition rules using XPaths and/or XML schema annotations. When the document is inserted into the system, it is implicitly shredded into multiple documents, and XInclude link elements are inserted in place of the original fragments. These inter-document links can be managed, queried and traversed as described above. Users can also recompose the original document by invoking native XInclude expansion functions."},"bibtype":"inproceedings","biburl":"http://dret.net/biblio/dret.bib","creationDate":"2014-08-28T18:19:45.942Z","downloads":0,"keywords":[],"search_terms":["trees","graphs","evolving","xml","building","enterprise","applications","murthy"],"title":"From Trees to Graphs: Evolving XML for Building Enterprise Applications","year":null,"dataSources":["mL7NKvaepNEWFcMvG"]}