Filters








1,614 Hits in 6.5 sec

Reuse or Never Reuse the Deleted Labels in XML Query Processing Based on Labeling Schemes [chapter]

Changqing Li, Tok Wang Ling, Min Hu
2006 Lecture Notes in Computer Science  
the deleted labels to query different versions of the XML data based on labeling schemes.  ...  We think that the deleted labels can be processed in two different directions: (1) reuse all the deleted labels to control the label size increasing speed and improve the query performance; (2) never reuse  ...  We propose another algorithm which never reuses the deleted labels and accordingly supports the query of different XML versions based on labeling schemes in Section 5.  ... 
doi:10.1007/11733836_46 fatcat:rbp5gjwj6vdwrbmfzrc3g6kwri

EBSL: Supporting Deleted Node Label Reuse in XML [chapter]

Martin F. O'Connor, Mark Roantree
2010 Lecture Notes in Computer Science  
Further, we provide a deleted node label reuse strategy that best suits the nature of node insertions and deletions in an XML tree.  ...  The ability to reuse deleted node labels is a key property in achieving this goal.  ...  In our previous work [15] , we provided a holistic evaluation framework based on the desirable properties that are characteristic of a good dynamic labeling scheme for XML.  ... 
doi:10.1007/978-3-642-15684-7_7 fatcat:fyb3b6zdkfcb3m4gq7cwuft7bi

SCOOTER: A Compact and Scalable Dynamic Labeling Scheme for XML Updates [chapter]

Martin F. O'Connor, Mark Roantree
2012 Lecture Notes in Computer Science  
, the labels grow rapidly and consequently have a significant impact on query and update performance.  ...  In particular, though there are labeling schemes that ensure a compact label representation when creating an XML document, when the document is subject to repeated and arbitrary deletions and insertions  ...  Algorithm 3: Insert New Node After Rightmost Node. input : left self label N lef t , N lef t is not empty. output: New self label Nnew such that N lef t ≺ Nnew Lastly, we are adapting SCOOTER to work in  ... 
doi:10.1007/978-3-642-32600-4_4 fatcat:axjarvcjd5fsfguuve5xfmt7eq

Efficient updates in dynamic XML data: from binary string to quaternary string

Changqing Li, Tok Wang Ling, Min Hu
2006 The VLDB journal  
XML query processing based on labeling schemes has been thoroughly studied in the past several years. Recently efficient processing of updates in dynamic XML data has gained more attention.  ...  the existing codes; (2) CDBS is orthogonal to specific labeling schemes, thus it can be applied broadly to different labeling schemes or other applications to efficiently process updates.  ...  Reusing the deleted labels and applying CDQS to different labeling schemes To reuse the deleted codes, similar to Algorithm 3, we can design an algorithm to reuse all the deleted CDQS codes.  ... 
doi:10.1007/s00778-006-0021-2 fatcat:kzutpyclbbgjpo755rouxxauzm

Efficient evaluation of preference query processes using twig caches

SungRan Cho, Wolf-Tilo Balke
2009 2009 Third International Conference on Research Challenges in Information Science  
In this paper we propose a structural join-based caching scheme that allows preference queries to reuse the most beneficial structural join results of all previous queries.  ...  Therefore XML query processing over large volumes of data needs to make the most out of already spent processing time by caching common (sub)expressions for reuse.  ...  ACKNOWLEDGMENT Parts of this work was carried out within the Emmy Noether Program of Excellence of the German Research Foundation (DFG).  ... 
doi:10.1109/rcis.2009.5089300 dblp:conf/rcis/BalkeC09 fatcat:j76cs3czuvamxhgkhijg3om3yu

Indexing and querying XML using extended Dewey labeling scheme

Jiaheng Lu, Xiaofeng Meng, Tok Wang Ling
2011 Data & Knowledge Engineering  
The Dewey labeling scheme is commonly used to label an XML document to facilitate XML query processing by recording information on the path of an element.  ...  types and identifiers of elements in a label, and to avoid the scan of labels for internal query nodes to accelerate query processing (in I/O cost).  ...  Dynamic XML labeling We next discuss how to support updates in XML documents based on extended Dewey labeling scheme.  ... 
doi:10.1016/j.datak.2010.08.001 fatcat:6gtgqelrrbgbfcn65tulsiqvci

FibLSS: A Scalable Label Storage Scheme for Dynamic XML Updates [chapter]

Martin F. O'Connor, Mark Roantree
2013 Lecture Notes in Computer Science  
Dynamic labeling schemes for XML updates have been the focus of significant research activity in recent years.  ...  We present a novel label storage scheme based on the Fibonacci sequence that can completely avoid relabeling existing nodes under dynamic insertions.  ...  The Fibonacci label storage scheme is scalable -it will never require a dynamic labeling scheme for XML to relabel nodes regardless of arbitrary or repeated dynamic node insertions and deletions.  ... 
doi:10.1007/978-3-642-40683-6_17 fatcat:flmosyji35g5fnysh3xdrsurfa

Bringing Mathematics to the Web of Data: The Case of the Mathematics Subject Classification [chapter]

Christoph Lange, Patrick Ion, Anastasia Dimou, Charalampos Bratsas, Wolfram Sperber, Michael Kohlhase, Ioannis Antoniou
2012 Lecture Notes in Computer Science  
While it is widely used, its traditional, idiosyncratic conceptualization and representation did not encourage wide reuse on the Web, and it made the scheme hard to maintain.  ...  publications in mathematics.  ...  Each change from the previous version can be clearly seen (additions in green, deletions in red, on a yellow background) 4 .  ... 
doi:10.1007/978-3-642-30284-8_58 fatcat:r5qlhowkqraibfwfukcstdimca

TIMBER: A native XML database

H.V. Jagadish, S. Al-Khalifa, A. Chapman, L.V.S. Lakshmanan, A. Nierman, S. Paparizos, J.M. Patel, D. Srivastava, N. Wiwatwattana, Y. Wu, C. Yu
2002 The VLDB journal  
We believe that the key intellectual contribution of this system is a comprehensive set-at-a-time query processing ability in a native XML store, with all the standard components of relational query processing  ...  New access methods have been developed to evaluate queries in the XML context, and new cost estimation and query optimization techniques have also been developed.  ...  How-ever, considerable additional processing may be possible, in the case of XML, based purely on the node identifiers.  ... 
doi:10.1007/s00778-002-0081-x fatcat:upos764ltzaptow3t7vsqeov24

Supporting hierarchical data in SAP HANA

Robert Brunel, Jan Finis, Gerald Franz, Norman May, Alfons Kemper, Thomas Neumann, Franz Faerber
2015 2015 IEEE 31st International Conference on Data Engineering  
Our research puts a new twist on handling hierarchies in SQL-based systems.  ...  The constructs can be evaluated efficiently by leveraging existing indexing and query processing techniques.  ...  Labeling schemes have been studied extensively in the XML context. Two prominent subcategories are order-based schemes as studied by Grust et al.  ... 
doi:10.1109/icde.2015.7113376 dblp:conf/icde/BrunelFFMK0F15 fatcat:3bs6gosaxzfipau6svjmacstuu

Indexing highly dynamic hierarchical data

Jan Finis, Robert Brunel, Alfons Kemper, Thomas Neumann, Norman May, Franz Faerber
2015 Proceedings of the VLDB Endowment  
Labeling schemes are widely considered the indexing technique of choice for hierarchical data, and many different schemes have been proposed.  ...  Maintaining and querying hierarchical data in a relational database system is an important task in many business applications.  ...  Especially labeling schemes are backed by a massive body of research on XML databases, on techniques for storing XML fragments in an RDBMS backend, and on evaluating query languages such as XPath and XQuery  ... 
doi:10.14778/2794367.2794369 fatcat:orwpgms7grawzc3xdff3s2jon4

Scientific Workflows and Provenance: Introduction and Research Opportunities

Víctor Cuevas-Vicenttín, Saumen Dey, Sven Köhler, Sean Riddle, Bertram Ludäscher
2012 Datenbank-Spektrum  
While the database community has studied (business) workflow technologies extensively in the past, most current work in scientific workflows seems to be done outside of the database community, e.g., by  ...  However, as described in the paper, important research challenges remain.  ...  Acknowledgements Work supported in part by NSF awards OCI-0830944, OCI-0722079, DGE-0841297, and DBI-0960535.  ... 
doi:10.1007/s13222-012-0100-z fatcat:uxhq7lmp75a2vmt2c2sqqt5cje

BFilter: Efficient XML Message Filtering and Matching in Publish/Subscribe Systems

Liang Dai, Chung-Horng Lung
2016 Journal of Software  
Hence, the performance of XML-based multicast depends heavily on the approach used to process the XML message.  ...  Most of those techniques do not address complex queries with predicates, twig patterns or branches; some require post-processing or a special coding scheme, which is either time consuming or becomes difficult  ...  Acknowledgment The authors wish to acknowledge Alcatel-Lucent and Ontario Centres of Excellence for their financial support throughout the project.  ... 
doi:10.17706/jsw.11.4.376-402 fatcat:i2o7zzxoyfaw3c7dzge6y5unyu

System RX

Kevin Beyer, Normen Seemann, Tuong Truong, Bert Van der Linden, Brian Vickery, Chun Zhang, Roberta J. Cochrane, Vanja Josifovski, Jim Kleewein, George Lapis, Guy Lohman, Bob Lyle (+2 others)
2005 Proceedings of the 2005 ACM SIGMOD international conference on Management of data - SIGMOD '05  
The new support for XML includes native support for storage and indexing as well as query compilation and evaluation support for the latest industry-standard query languages, SQL/XML and XQuery.  ...  We believe that such a system is fundamental in the evolution of enterprise data management solutions: XML and relational data will co-exist and complement each other in enterprise solutions.  ...  For high-performance bulk processing of XML data, it is important to have an underlying model that is based on a set-at-atime processing, as also argued by [23] .  ... 
doi:10.1145/1066157.1066197 dblp:conf/sigmod/OzcanCPKBJZ05 fatcat:zdaqtbw4dbaxpifxh36weluawa

Linked Data and Service Orientation [chapter]

Erik Wilde
2010 Lecture Notes in Computer Science  
data based on Semantic Web technologies, whereas the other school more generally defines it as any form of properly linked data that follows the Representational State Transfer (REST) architectural style  ...  In this paper, we describe and compare these two schools of thoughts with a particular emphasis on how well they support principles of service orientation.  ...  Self-Describing Messages: Interactions should be based on exchanges of messages (or documents) which are labeled with their type. 3 4.  ... 
doi:10.1007/978-3-642-17358-5_5 fatcat:drq6riowrvdermao5a253bpvuu
« Previous Showing results 1 — 15 out of 1,614 results