Using an Oracle Repository to Accelerate XPath Queries
|
|
- Jordan Thornton
- 5 years ago
- Views:
Transcription
1 Using an Oracle Repository to Accelerate XPath Queries Colm Noonan, Cian Durrigan, and Mark Roantree Interoperable Systems Group, Dublin City University, Dublin 9, Ireland {cnoonan, cdurrigan, Abstract. One of the problems associated with XML databases is the poor performance of XPath queries. Although this has attracted much attention by the research community, solutions are either partial (not providing full XPath functionality) or unable to manage database updates. In this work, we exploit features of Oracle 10g in order to rapidly build indexes that improve the processing times of XML databases. Significantly, we can also support XML database updates as the rebuild time for entire indexes is reasonably fast and thus, provides for flexible update strategies. This paper discusses the process for building the index repository and describes a series of experiments that demonstrate our improved query response times. 1 Introduction Native XML databases perform badly for many complex queries where the database size is large or the structure complex. Efforts to use an index are hampered by the fact that the reconstruction of these indexes (after update operations) is time-consuming. In previous research [9], we devised an indexing method to improve the performance of XPath queries. In this work, we focused on the theoretical aspects of indexing and devised a method of providing fast access to XML nodes based on the principal axes used by XPath to generate query results. In our previous work we introduced the PreLevel indexing method and provided theoretical proofs of its ability to cover the full functionality of the XPath Query Language and presented optimised algorithms for XML tree traversals [9]. For each of the primary XPath axes, conjunctive range predicates were derived from the intrinsic properties of the preorder traversal ranks and level ranks. By recording both preorder and level rankings (together with appropriate element values) in the PreLevel index, we provided algorithms to facilitate optimised query response times. The work presented in our current paper was carried out as part of the FAST project (Flexible indexing Algorithm using Semantic Tags). This research is funded by a Proof of Concept grant where theoretical ideas are deployed to provide state-of-the art solutions to current problems. The contribution of this Funded By Enterprise Ireland Grant PC/2005/0049. S. Bressan, J. Küng, and R. Wagner (Eds.): DEXA 2006, LNCS 4080, pp , c Springer-Verlag Berlin Heidelberg 2006
2 74 C. Noonan, C. Durrigan, and M. Roantree work is in the provision of a new XPath Query Interface that performs well against the current efforts in the area. Furthermore, we have extended the work in [9] by delivering a fast method of creating the Semantic Repository and also by introducing a multi-index system to fine-tune query performance. The paper is structured as follows: in 2, we discuss similar research in XML querying; in 3, an outline of the FAST Repository is provided, together with the process used to construct it; in 4, we describe our process for semantic query routing; in 5, we provide experimental data in 6, we offer some conclusions. 2 Related Research Our approach is to employ a native XML database and support the query processing effort with an indexing method deployed using traditional database techniques. In this section, we examine similar efforts in this area. XML Enabled Databases. Many researchers including [5,13] have chosen to enable relational databases systems rather than employ a native XML database. In [13], they explore how XML enabled databases can support XML queries by: 1. Utilising two separate indexes on element and text values. 2. Incorporating the MPMGJN algorithm, that is different from the standard merge join algorithms found on commercial databases. 3. Converting XQuery expressions into SQL statements. The results [13] suggest that the MPMGJN algorithm is more efficient at supporting XML queries than any of the join algorithms found in commercial XML enabled databases. By incorporating the MPMGJN algorithm into the query execution machinery of the RDBMS, they can become efficient in XML storage and processing. However, this approach requires that all XML queries be converted to SQL and in [7], they show that not all XQuery expressions can be translated into SQL, and in some cases, translate into inefficient SQL statements. A further disadvantage of enabled XML databases is their inefficiency at retrieving entire or subsets of an XML document, as it may require several costly joins to construct the required result [3]. Native XML Databases. Our PreLevel index structure is an extension of the XPath Accelerator [4], which uses an index structure designed to support the evaluation of XPath queries. This index is capable of supporting the evaluation of all XPath axes (including ancestor, following, child, etc)[2].itemploysa SAX processor to create pre and post order encoding of nodes that capture the structural and value-based semantics of an XML document. Furthermore, the ability to start traversals from arbitrary context nodes in an XML document allows the index to support XPath expressions that are embedded in XQuery expressions. In [11], the experience of building Jungle, a secondary storage manager for Galax (an open source native XML database) is detailed. In order to optimise
3 Using an Oracle Repository to Accelerate XPath Queries 75 query processing, they used the XPath Accelerator and indexing structure. However, one major limitation they encountered was the evaluation of the child axis, which they found to be as expensive as evaluating the descendant axis. They deemed this limitation to be unacceptable and designed their own indexes to support the child axis. Although the XPath Accelerator s pre/post encoding scheme has since been updated in [5] to use pre/level/size, our PreLevel Structure as demonstrated in [9] supports highly efficient evaluations of not just children but also of descendants of any arbitrary node. The Jungle implementation experience also highlighted the significant overhead imposed at document loading time by a postorder traversal, which is not required by the PreLevel index structure. 3 The FAST Repository The processing architecture illustrated in Fig. 1 has three levels: document level, metadata level and storage level. In this section, we begin by describing the role of the processors connecting the levels and at the end of the section, we present the comparative times for a range of XML databases. For reasons of clarity, we now present some of the terminology we use. The metadata extraction file (see 1 in Fig. 1) is a text document; the Oracle table identified as 2 inthesamefigure is called the Base Index Table (BIT); and the set of tables identified as 3 are called the Primary Index Tables (PIT). 3.1 Metadata Extraction The Metadata Extractor processes the document set at level 1 to generate the metadata document set at level 2. A basic SAX parser has been enhanced with semantic rules that trigger events to extract the data required for the PreLevel indexing method. These events deliver the attributes stored in the metadata document and are described below: As each node is visited the PreOrder and Level events obtain the pre-order value of the node and the level at which it occurs in the XML document tree. For performance reasons, the Position event determines the position of each node as it occurs at each level in the hierarchy (left to right). This is used to optimise algorithms that operate across a single level. As each node is read, the Parent event returns the preorder value of the node s parent. The Type event is used to distinguish between elements and attributes. The Name and Value events record the name and value of the node. The FullPath event is used to record the entire XML path (from node to root). The DocID event is fired by the exist database to provide its internal document identifier for the XML document.
4 76 C. Noonan, C. Durrigan, and M. Roantree Level 1: Document XML Document set Metadata Extractor Level 2: Metadata 1 metadata exist Storage Bulk Storage Semantic Indexing Level 3: Storage exist 2 3 Fig. 1. Repository Processing Architecture 3.2 exist Storage Processor The exist database [6] provides a schema-less storage of XML documents in hierarchical collections and can store a large amount of XML data. It also uses built-in methods to store XML documents in its document store with indexed paged files. The exist Storage Processor stores an XML document in the form of collections (of sub-documents), in a hierarchical structure. There is a single parent collection that acts as the root and using this organisational structure, exist ensures the speed of querying and information retrieval is significantly faster. 3.3 Bulk Storage Processor One of the problems with constructing indexes for XML documents is that they tend to be very large with one or more tuples for each node. Thus, building the index can be time-consuming and makes the prospect of document updates difficult. While some form of incremental updating process can be used to address this problem, we sought to find a means of building entire indexes quickly. Using Oracle, it is possible to significantly reduce the time required for large amounts of information (in the case of DBLP, millions of rows) to be inserted, through a bulk loading process. Oracle s SQL*Loader provides a means of bypassing time consuming SQL INSERT commands by presenting the loader with a control file containing a metadata description of a large text file (generated by our Metadata Extraction processor). The Oracle Storage Processor loads the text file generated by the Metadata Extractor and creates the control file required by the SQL*Loader. The output from this processor is the creation of the Base Index Table (BIT) in Oracle.
5 Using an Oracle Repository to Accelerate XPath Queries Semantic Indexing Processor This processor is used to create a set of Primary Index Tables that can be used to improve times for different types of queries. At present, the semantic rules are quite simple. Initially, a Metadata Table is created containing useful statistics of the XML data and one set of statistics contains the total number of data elements in the document set (EntireTotal), each element name (ElemName), the number of element types (ElemTypeCount) and the number of occurrences of this element (ElemTotal). For each element that exceeds a threshold Tix, the Semantic Index Processor generates a Primary Index Table. Tix is calculated by multiplying the average number of elements (ElemAvg = EntireTotal/ElemTypeCount) by an IndexFactor that is currently set at 2, based on our empirical study of XML document content. Thus, an element whose value for ElemTotal Tix will have a Primary Index Table created. We have found that this has performance advantages over the creation of multiple indexes on the Base Index Table. 3.5 Repository Build Times In our experiments, we built the semantic repository for five XML databases on a Dell Optiplex GX620 (3.20GHz) workstation with 1GB RAM on a Windows platform. In Fig. 2 we provide the build times for five standard XML databases [12]. The role of the Bulk Storage Processor played a significant role as the time required to generate the Semantic Repository for DBLP using SQL INSERT commands was 8.13 hours and is now reduced to seconds using the same workstation. Name Size Rows Elems. Atts. Levels BIT PIT BIT+PIT DBLP 127MB s 299.0s 557.9s Line 30MB s 3.7s 67.1s Item UWM 2MB s 0.3s 4.1s AT_meta 28MB s 75.7s 135.1s Mondial 1MB s 1.6s 5.0s Fig. 2. Repository Construction Times 4 Query Processing The first role of the Query Router (QR) is to classify the query into one of the following three categories: Index Query. These queries are resolved at the index level and are regarded as text node queries (see 5). Partial XPath Query. These queries are processed and routed to more precise locations in the database. They then use the XQuery processor of the native XML database.
6 78 C. Noonan, C. Durrigan, and M. Roantree FullXPathQuery.These queries are resolved at the index level to generate a set of unique exist identifiers. These identifiers allow direct access to the result documents in the database and do not require exist s XQuery Interface. For reasons of space, we concentrate on the Partial XPath Query category as this employs all features of the Semantic Repository and works with the native XML database to generate the query result set. The QR currently accepts only XPath queries as input but will convert these to XQuery FLWOR expressions on output. 4.1 Query Router The Query Router breaks the location path of an XPath expression into its location steps. Each location step comprises an axis, a node test (specifies the node type and name) and zero or more predicates. The role of this processor is to modify the XPath axis to provide a more precise location using the algorithms described in [9] and the data stored in the Semantic Repository. In example 1, the XPath query retrieves the book titles for the named author. Example 1. //book[author = Bertrand Meyer ]/title In Fig. 3(a), the location steps generated by the XPath parser are shown. The XPath axes, the appropriate nodes and the predicate for the book node are displayed. The main role of the Query Router is to provide a more precise location path and thus improve query performance. Using the descendant-or-self axis from the root, query processing involves the root node and all of its descendants until it finds the appropriate book node: our optimiser (using the PreLevel index) can quickly identify a precise path from the root to this book node. In this example, it requires a modified location step as displayed in Fig. 3(b). The Base Index Table is the default index used to improve performance but before this takes place, a check is made to determine if one of the Primary Index Tables can be used. In the node test part of the XPath expression, the Query Router checks to see if one of the PIT set is sorted on that particular element and if so, can use that index. Example 2. for $title in doc( /db/dblp/dblp.xml )/dblp/book[author = Bertrand Meyer ]/title return $title Step Axis Node Predicates Test 1 descendant-or-self node() 2 child book [author = Bertrand Meyer ] 3 child title (a) Step Axis Node Predicates Test 1 child dblp 2 child book [author = Bertrand Meyer ] 3 child title (b) Fig. 3. Location Steps
7 Using an Oracle Repository to Accelerate XPath Queries 79 The final part of this process is the construction of one or more XQuery FLWOR expressions by inserting the modified axis expressions into the for clause. This expression in example 2 is passed to the native XQuery processor to complete the result set. 5 Details of Query Performance All experiments were run using a 3GHz Pentium IV machine with 1GB memory on a Windows XP platform. The Query Router runs using Eclipse 3.1 with Java virtual machine (JVM) version 1.5. The Repository was deployed using Oracle 10g (running a LINUX operating system, with a 2.8 GHz Pentium IV processor and 1GB of memory) and exist (Windows platform with a 1.8 GHz Pentium IV processor and 512MB of memory) database servers. The default JVM machine settings of exist were increased from -Xmx128000k to -Xmx256000k to maximise efficiency. The DBLP XML database was chosen (see Fig. 2 for details) for its size. For the purpose of this paper, we extracted a subset of the original query set [8], and extended a categorisation originally used in [1]. Empty queries (Q5) are those that return zero matches. Text node queries (Q6) are queries that return text nodes i.e. XPath queries thatendwiththetext() function. Wildcard queries (Q2) are queries that contain a wildcard character. Punctual queries (Q1, Q3, Q4) query only a small portion of the database and have a high selectivity, thus they return a small number of matches. Low selectivity queries (Q6, Q7) are queries that may return a large number of matches. Table 1. DBLP Queries used in our experiments Query XPath Expression Matches Q1 //inproceedings[./title/text() = Semantic Analysis Patterns. ]/author 2 Q2 //inproceedings[./*/text() = Semantic Analysis Patterns. ]/author 2 Q3 //book[author = Bertrand Meyer ]/title 13 Q4 //inproceedings[./author = Jim Gray ][./year = 1990 ]/@key 6 Q5 //site/people/person[@id = person ] 0 Q6 //title/text() 328,859 Q7 /dblp/book/series Queries and Performance Measures In order to obtain contrasting results, we ran all queries under varying support modes: 1. exist. The XPath query is executed using the exist query processor only. 2. exist + BIT. The XPath query pre-processed using the Base Index Table before being passed to the exist query processor.
8 80 C. Noonan, C. Durrigan, and M. Roantree 3. exist + PIT. The XPath query pre-processed using a Primary Index Table before being passed to the exist query processor. 4. PreLevel. The XPath query is processed at the PreLevel index without using the exist query processor. For each query, all the execution times are recorded in milliseconds (ms), together with the number of matches. The times were averaged (with the first run elimination) to ensure that all results are warm cache numbers. Table 2 displays the execution times for each of the seven queries in each support mode. Some of the queries (Q2, Q6) in the exist mode failed to return any results (R2, R6), as exist continually returned an out of memory error. Although the exist user guide suggests the alteration of JVM settings in order to address the problem, even with optimum JVM settings, these queries fail to generate a result. Table 2. Query Execution Times Result exist exist+bit exist+pit PreLevel R1 20, , ,408.2 N/A R2 19, ,412.9 N/A R As exist + BIT N/A R4 3,209 2, ,721.3 N/A R As exist + BIT N/A R6 102, , ,648.2 R ,480 As exist +BIT N/A 5.2 Performance Analysis Results R1, R3 and R4 show that the Query Router (QR) can make a significant difference to punctual queries. Furthermore, the results indicate that the PIT (where available) is more efficient than the BIT at routing XPath queries. Result R5 suggests that the QR can efficiently handle queries that return empty result sets. This is because the QR will always consult its Semantic Repository (SR) to ensure that a query has a positive number of matches before passing the query to exist. The multi-index feature of the SR ensures that this type of query is identified quickly. As text node queries (Q6) require only the PreLevel index for processing, they run far more efficiently in the PreLevel mode. Result R7 indicates that the QR will not improve the performance of child queries. This is not unexpected as exist handles this form of query well. The QR performs less favourably because it must perform an index look-up in order to determine the respective document URI(s) which are required in each XQuery expression. However we believe that with the incorporation of a meta-metatable containing summarised data for each fullpath expression and their respective document URIs, the QR will be able to outperform exist for even this form of query. This research forms part of ongoing research and initial results are positive [10]. The exist processor cannot handle the upper scale of low selectivity queries such as Q6 that return a very large number of matches. However the QR can process the upper scale of low selectivity queries, by:
9 Using an Oracle Repository to Accelerate XPath Queries 81 Utilising our Semantic Repository to calculate the number of matches for a low selectivity query. If the number of matches is greater than a set threshold (50,000 in our current experiment setup), the QR will break the low selectivity query into a number (equal to (number of matches/threshold) + 1) of child queries. The resulting child queries are equivalent to the low selectivity query. The exist processor also fails to handle wildcards where the search range is high or the database is very large (Q2). If there is a wildcard character in the node test or predicate clauses, the QR removes the wildcard by processing the wildcard option at the PreLevel index. This aspect of the QR is not yet fully functional: it can only remove wildcards in certain queries. 6 Conclusions In this paper, we presented our approach to improving the performance of XPath queries. In this context, we discussed the construction of the FAST Semantic Repository, which includes an indexing structure based upon our prior work on level based indexing for XPath performance. In our current work, we provide an extended indexing structure deployed using Oracle 10g and exploit some of Oracle s features to ensure a fast rebuilding of the index. Using our Query Router we can then exploit our indexing structures in one of two broad modes: using the indexing method to fully resolve the query; use either the Base or Primary Index Table together with the exist XQuery processor to generate the result set. The Query Router accepts XPath expressions as input and creates XQuery expressions (where necessary) for the exist database. We also describe a series of experiments to support our claims that XPath expressions can be optimised using our indexing structures. Together with the fast rebuilding of the index, this method supports not only fast XPath queries, but also a strong basis for the provision of updates. The construction time for a large index is between 60 and 260 seconds, and this allows for rebuilding the index multiple times during the course of the day. This provides the basis for appending to updateable indexes with full rebuilds at set intervals. Thus, our current research focus is on managing update queries. We are also examining the cost of PIT builds against their increase in query performance as a fine-tuning measure for the index. Finally, our next version of the FAST prototype should include an interface for both XPath and XQuery expressions. References 1. Barta A., Consens M. and Mendelzon A. Benefits of Path Summaries in an XML Query Optimizer Supporting Multiple Access Methods. In Proceedings of the 31st VLDB Conference, pp , Morgan Kaufmann, Berglund A. et al. XML Path Language (XPath 2.0), Technical Report W3C Working Draft, WWW Consortium (
10 82 C. Noonan, C. Durrigan, and M. Roantree 3. Beyer K. et al. System RX: One Part Relational, One Part XML. In Proceedings of ACM SIGMOD Conference on Management of data, pp , ACM Press, Grust T. Accelerating XPath Location Steps. In Proceedings of the 2002 ACM SIGMOND International Conference on the Management of Data, volume 31, SIG- MOND Record, pp , ACM Press, Grust T., Sakr S. and Teuber J. XQuery on SQL Hosts. In Proceedings of the 30th International Conference on Very Large Databases (VLDB), pp , Morgan Kaufmann, Meier W. exist: An Open Source Native XML Database. In Web, Web-Services, and Database Systems, LNCS 2593, pp , Springer, Manolescu I., Florescu D., Kossmann D. Answering XML Queries on Heterogeneous Data Sources, In Proceedings of the 27th International Conference on Very Large Databases (VLDB), pp , Morgan Kaufmann, Noonan C. XPath Query Routing in the FAST Project. Technical Report ISG-06-01, isg, O Connor M., Bellahsene Z. and Roantree M. An Extended Preorder Index for Optimising XPath Expressions. In Proceedings of 3rd XML Database Symposium (XSym), LNCS Vol. 3671, pp , Springer, Roantree M. The FAST Prototype: a Flexible indexing Algorithm using Semantic Tags. Technical Report ISG-06-02, isg, Vyas A., Fernández M. and Simèon J. The Simplest XML Storage Manager Ever., In Proceedings of the First International Workshop on XQuery Implementation, Experience and Perspectives <XIME-P/>, in cooperation with ACM SIGMOD, pp 27-42, The XML Data Repository. xmldatasets/, Zhang C. et al. On Supporting Containment Queries in Relational Database Management Systems, In Proceedings of the 2001 ACM SIGMOD International Conference on the Management of Data, pp , ACM Press, 2001.
Optimising XML-Based Web Information Systems
Optimising XML-Based Web Information Systems Colm Noonan and Mark Roantree Interoperable Systems Group, Dublin City University, Ireland - {mark,cnoonan}@computing.dcu.ie Abstract. Many Web Information
More informationAn Efficient XML Index Structure with Bottom-Up Query Processing
An Efficient XML Index Structure with Bottom-Up Query Processing Dong Min Seo, Jae Soo Yoo, and Ki Hyung Cho Department of Computer and Communication Engineering, Chungbuk National University, 48 Gaesin-dong,
More informationAn Extended Preorder Index for Optimising XPath Expressions
An Extended Preorder Index for Optimising XPath Expressions Martin F O Connor, Zohra Bellahsène, and Mark Roantree Interoperable Systems Group, Dublin City University, Ireland. Email: {moconnor,mark.roantree}@computing.dcu.ie
More informationAccelerating XML Structural Matching Using Suffix Bitmaps
Accelerating XML Structural Matching Using Suffix Bitmaps Feng Shao, Gang Chen, and Jinxiang Dong Dept. of Computer Science, Zhejiang University, Hangzhou, P.R. China microf_shao@msn.com, cg@zju.edu.cn,
More informationA FRAMEWORK FOR EFFICIENT DATA SEARCH THROUGH XML TREE PATTERNS
A FRAMEWORK FOR EFFICIENT DATA SEARCH THROUGH XML TREE PATTERNS SRIVANI SARIKONDA 1 PG Scholar Department of CSE P.SANDEEP REDDY 2 Associate professor Department of CSE DR.M.V.SIVA PRASAD 3 Principal Abstract:
More informationPart XII. Mapping XML to Databases. Torsten Grust (WSI) Database-Supported XML Processors Winter 2008/09 321
Part XII Mapping XML to Databases Torsten Grust (WSI) Database-Supported XML Processors Winter 2008/09 321 Outline of this part 1 Mapping XML to Databases Introduction 2 Relational Tree Encoding Dead Ends
More informationFull-Text and Structural XML Indexing on B + -Tree
Full-Text and Structural XML Indexing on B + -Tree Toshiyuki Shimizu 1 and Masatoshi Yoshikawa 2 1 Graduate School of Information Science, Nagoya University shimizu@dl.itc.nagoya-u.ac.jp 2 Information
More informationIntegrating Path Index with Value Index for XML data
Integrating Path Index with Value Index for XML data Jing Wang 1, Xiaofeng Meng 2, Shan Wang 2 1 Institute of Computing Technology, Chinese Academy of Sciences, 100080 Beijing, China cuckoowj@btamail.net.cn
More informationOutline. Approximation: Theory and Algorithms. Ordered Labeled Trees in a Relational Database (II/II) Nikolaus Augsten. Unit 5 March 30, 2009
Outline Approximation: Theory and Algorithms Ordered Labeled Trees in a Relational Database (II/II) Nikolaus Augsten 1 2 3 Experimental Comparison of the Encodings Free University of Bozen-Bolzano Faculty
More informationA System for Storing, Retrieving, Organizing and Managing Web Services Metadata Using Relational Database *
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 6, No 1 Sofia 2006 A System for Storing, Retrieving, Organizing and Managing Web Services Metadata Using Relational Database
More informationIndex-Driven XQuery Processing in the exist XML Database
Index-Driven XQuery Processing in the exist XML Database Wolfgang Meier wolfgang@exist-db.org The exist Project XML Prague, June 17, 2006 Outline 1 Introducing exist 2 Node Identification Schemes and Indexing
More informationCompression of the Stream Array Data Structure
Compression of the Stream Array Data Structure Radim Bača and Martin Pawlas Department of Computer Science, Technical University of Ostrava Czech Republic {radim.baca,martin.pawlas}@vsb.cz Abstract. In
More informationQuickXDB: A Prototype of a Native XML QuickXDB: Prototype of Native XML DBMS DBMS
QuickXDB: A Prototype of a Native XML QuickXDB: Prototype of Native XML DBMS DBMS Petr Lukáš, Radim Bača, and Michal Krátký Petr Lukáš, Radim Bača, and Michal Krátký Department of Computer Science, VŠB
More informationPart XVII. Staircase Join Tree-Aware Relational (X)Query Processing. Torsten Grust (WSI) Database-Supported XML Processors Winter 2008/09 440
Part XVII Staircase Join Tree-Aware Relational (X)Query Processing Torsten Grust (WSI) Database-Supported XML Processors Winter 2008/09 440 Outline of this part 1 XPath Accelerator Tree aware relational
More informationMQEB: Metadata-based Query Evaluation of Bi-labeled XML data
MQEB: Metadata-based Query Evaluation of Bi-labeled XML data Rajesh Kumar A and P Sreenivasa Kumar Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036, India.
More informationUpdating XML documents
Grindei Manuela Lidia Updating XML documents XQuery Update XQuery is the a powerful functional language, which enables accessing different nodes of an XML document. However, updating could not be done
More informationTriangle Strip Multiresolution Modelling Using Sorted Edges
Triangle Strip Multiresolution Modelling Using Sorted Edges Ó. Belmonte Fernández, S. Aguado González, and S. Sancho Chust Department of Computer Languages and Systems Universitat Jaume I 12071 Castellon,
More informationIndexing XML Data with ToXin
Indexing XML Data with ToXin Flavio Rizzolo, Alberto Mendelzon University of Toronto Department of Computer Science {flavio,mendel}@cs.toronto.edu Abstract Indexing schemes for semistructured data have
More informationAN EFFECTIVE APPROACH FOR MODIFYING XML DOCUMENTS IN THE CONTEXT OF MESSAGE BROKERING
AN EFFECTIVE APPROACH FOR MODIFYING XML DOCUMENTS IN THE CONTEXT OF MESSAGE BROKERING R. Gururaj, Indian Institute of Technology Madras, gururaj@cs.iitm.ernet.in M. Giridhar Reddy, Indian Institute of
More informationSymmetrically Exploiting XML
Symmetrically Exploiting XML Shuohao Zhang and Curtis Dyreson School of E.E. and Computer Science Washington State University Pullman, Washington, USA The 15 th International World Wide Web Conference
More informationBottom-Up Evaluation of Twig Join Pattern Queries in XML Document Databases
Bottom-Up Evaluation of Twig Join Pattern Queries in XML Document Databases Yangjun Chen Department of Applied Computer Science University of Winnipeg Winnipeg, Manitoba, Canada R3B 2E9 y.chen@uwinnipeg.ca
More informationXML Data Stream Processing: Extensions to YFilter
XML Data Stream Processing: Extensions to YFilter Shaolei Feng and Giridhar Kumaran January 31, 2007 Abstract Running XPath queries on XML data steams is a challenge. Current approaches that store the
More informationSFilter: A Simple and Scalable Filter for XML Streams
SFilter: A Simple and Scalable Filter for XML Streams Abdul Nizar M., G. Suresh Babu, P. Sreenivasa Kumar Indian Institute of Technology Madras Chennai - 600 036 INDIA nizar@cse.iitm.ac.in, sureshbabuau@gmail.com,
More informationADT 2009 Other Approaches to XQuery Processing
Other Approaches to XQuery Processing Stefan Manegold Stefan.Manegold@cwi.nl http://www.cwi.nl/~manegold/ 12.11.2009: Schedule 2 RDBMS back-end support for XML/XQuery (1/2): Document Representation (XPath
More informationAn Extended Byte Carry Labeling Scheme for Dynamic XML Data
Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 5488 5492 An Extended Byte Carry Labeling Scheme for Dynamic XML Data YU Sheng a,b WU Minghui a,b, * LIU Lin a,b a School of Computer
More informationEcient XPath Axis Evaluation for DOM Data Structures
Ecient XPath Axis Evaluation for DOM Data Structures Jan Hidders Philippe Michiels University of Antwerp Dept. of Math. and Comp. Science Middelheimlaan 1, BE-2020 Antwerp, Belgium, fjan.hidders,philippe.michielsg@ua.ac.be
More informationXML databases. Jan Chomicki. University at Buffalo. Jan Chomicki (University at Buffalo) XML databases 1 / 9
XML databases Jan Chomicki University at Buffalo Jan Chomicki (University at Buffalo) XML databases 1 / 9 Outline 1 XML data model 2 XPath 3 XQuery Jan Chomicki (University at Buffalo) XML databases 2
More informationA New Way of Generating Reusable Index Labels for Dynamic XML
A New Way of Generating Reusable Index Labels for Dynamic XML P. Jayanthi, Dr. A. Tamilarasi Department of CSE, Kongu Engineering College, Perundurai 638 052, Erode, Tamilnadu, India. Abstract XML now
More informationRELATIONAL STORAGE FOR XML RULES
RELATIONAL STORAGE FOR XML RULES A. A. Abd El-Aziz Research Scholar Dept. of Information Science & Technology Anna University Email: abdelazizahmed@auist.net Professor A. Kannan Dept. of Information Science
More informationINTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK CONVERTING XML DOCUMENT TO SQL QUERY MISS. ANUPAMA V. ZAKARDE 1, DR. H. R. DESHMUKH
More informationSecurity-Conscious XML Indexing
Security-Conscious XML Indexing Yan Xiao, Bo Luo, and Dongwon Lee The Pennsylvania State University, University Park, USA xiaoyan515@gmail.com, {bluo,dongwon}@psu.edu Abstract. To support secure exchanging
More informationPoster Session: An Indexing Structure for Automatic Schema Matching
Poster Session: An Indexing Structure for Automatic Schema Matching Fabien Duchateau LIRMM - UMR 5506 Université Montpellier 2 34392 Montpellier Cedex 5 - France duchatea@lirmm.fr Mark Roantree Interoperable
More informationCHAPTER 3 LITERATURE REVIEW
20 CHAPTER 3 LITERATURE REVIEW This chapter presents query processing with XML documents, indexing techniques and current algorithms for generating labels. Here, each labeling algorithm and its limitations
More informationA Digital Library Framework for Reusing e-learning Video Documents
A Digital Library Framework for Reusing e-learning Video Documents Paolo Bolettieri, Fabrizio Falchi, Claudio Gennaro, and Fausto Rabitti ISTI-CNR, via G. Moruzzi 1, 56124 Pisa, Italy paolo.bolettieri,fabrizio.falchi,claudio.gennaro,
More informationEfficient, Scalable, and Provenance-Aware Management of Linked Data
Efficient, Scalable, and Provenance-Aware Management of Linked Data Marcin Wylot 1 Motivation and objectives of the research The proliferation of heterogeneous Linked Data on the Web requires data management
More informationMonetDB/XQuery (2/2): High-Performance, Purely Relational XQuery Processing
ADT 2010 MonetDB/XQuery (2/2): High-Performance, Purely Relational XQuery Processing http://pathfinder-xquery.org/ http://monetdb-xquery.org/ Stefan Manegold Stefan.Manegold@cwi.nl http://www.cwi.nl/~manegold/
More informationEfficient Cube Construction for Smart City Data
Efficient Cube Construction for Smart City Data Michael Scriney & Mark Roantree Insight Centre for Data Analytics, School of Computing, Dublin City University, Dublin 9, Ireland michael.scriney@insight-centre.org,
More informationUSING MUL TIVERSION WEB SERVERS FOR DATA-BASED SYNCHRONIZATION OF COOPERATIVE WORK
USING MUL TIVERSION WEB SERVERS FOR DATA-BASED SYNCHRONIZATION OF COOPERATIVE WORK Jarogniew Rykowski Department of Information Technology The Poznan University of Economics Mansfolda 4 60-854 Poznan,
More informationQuerying and Updating XML with XML Schema constraints in an RDBMS
Querying and Updating XML with XML Schema constraints in an RDBMS H. Georgiadis I. Varlamis V. Vassalos Department of Informatics Athens University of Economics and Business Athens, Greece {harisgeo,varlamis,vassalos}@aueb.gr
More informationIMPLEMENTING A MODERN TEMPORAL DATA MANAGEMENT SYSTEM
IMPLEMENTING A MODERN TEMPORAL DATA MANAGEMENT SYSTEM Abstract Ramon Mata-Toledo 1 Morgan Monger 2 data management is a concept that has been around for many years. A temporal data management system (TDMS)
More informationUsing a Relational Database for Scalable XML Search
Using a Relational Database for Scalable XML Search Rebecca J. Cathey, Steven M. Beitzel, Eric C. Jensen, David Grossman, Ophir Frieder Information Retrieval Laboratory Department of Computer Science Illinois
More informationRelational Storage for XML Rules
Relational Storage for XML Rules A. A. Abd El-Aziz Research Scholar Dept. of Information Science & Technology Anna University Email: abdelazizahmed@auist.net A. Kannan Professor Dept. of Information Science
More informationXML: Extensible Markup Language
XML: Extensible Markup Language CSC 375, Fall 2015 XML is a classic political compromise: it balances the needs of man and machine by being equally unreadable to both. Matthew Might Slides slightly modified
More informationThe Importance of Algebra for XML Query Processing
The Importance of Algebra for XML Query Processing Stelios Paparizos and H.V. Jagadish University of Michigan, Ann Arbor, MI, USA {spapariz, jag}@umich.edu Abstract. Relational algebra has been a crucial
More informationKikori-KS: An Effective and Efficient Keyword Search System for Digital Libraries in XML
Kikori-KS An Effective and Efficient Keyword Search System for Digital Libraries in XML Toshiyuki Shimizu 1, Norimasa Terada 2, and Masatoshi Yoshikawa 1 1 Graduate School of Informatics, Kyoto University
More informationSemi-structured Data. 8 - XPath
Semi-structured Data 8 - XPath Andreas Pieris and Wolfgang Fischl, Summer Term 2016 Outline XPath Terminology XPath at First Glance Location Paths (Axis, Node Test, Predicate) Abbreviated Syntax What is
More informationWeb Data Management. Tree Pattern Evaluation. Philippe Rigaux CNAM Paris & INRIA Saclay
http://webdam.inria.fr/ Web Data Management Tree Pattern Evaluation Serge Abiteboul INRIA Saclay & ENS Cachan Ioana Manolescu INRIA Saclay & Paris-Sud University Philippe Rigaux CNAM Paris & INRIA Saclay
More informationB.H.GARDI COLLEGE OF MASTER OF COMPUTER APPLICATION. Ch. 1 :- Introduction Database Management System - 1
Basic Concepts :- 1. What is Data? Data is a collection of facts from which conclusion may be drawn. In computer science, data is anything in a form suitable for use with a computer. Data is often distinguished
More informationMotivation and basic concepts Storage Principle Query Principle Index Principle Implementation and Results Conclusion
JSON Schema-less into RDBMS Most of the material was taken from the Internet and the paper JSON data management: sup- porting schema-less development in RDBMS, Liu, Z.H., B. Hammerschmidt, and D. McMahon,
More informationEvaluating XPath Queries
Chapter 8 Evaluating XPath Queries Peter Wood (BBK) XML Data Management 201 / 353 Introduction When XML documents are small and can fit in memory, evaluating XPath expressions can be done efficiently But
More informationA Modular modular XQuery implementation
A Modular modular XQuery implementation Implementation Jan Vraný, Jan Jan Vraný, Jan Žák Žák Department of Computer Science and Engineering, FEE, Czech Technical University Department of Computer in Prague,
More information1 The size of the subtree rooted in node a is 5. 2 The leaf-to-root paths of nodes b, c meet in node d
Enhancing tree awareness 15. Staircase Join XPath Accelerator Tree aware relational XML resentation Tree awareness? 15. Staircase Join XPath Accelerator Tree aware relational XML resentation We now know
More informationSchema-Based XML-to-SQL Query Translation Using Interval Encoding
2011 Eighth International Conference on Information Technology: New Generations Schema-Based XML-to-SQL Query Translation Using Interval Encoding Mustafa Atay Department of Computer Science Winston-Salem
More informationAssociation Rule Mining from XML Data
144 Conference on Data Mining DMIN'06 Association Rule Mining from XML Data Qin Ding and Gnanasekaran Sundarraj Computer Science Program The Pennsylvania State University at Harrisburg Middletown, PA 17057,
More informationOracle Hyperion Profitability and Cost Management
Oracle Hyperion Profitability and Cost Management Configuration Guidelines for Detailed Profitability Applications November 2015 Contents About these Guidelines... 1 Setup and Configuration Guidelines...
More informationQuery Transformation of SQL into XQuery within Federated Environments
Query Transformation of SQL into XQuery within Federated Environments Heiko Jahnkuhn, Ilvio Bruder, Ammar Balouch, Manja Nelius, and Andreas Heuer Department of Computer Science, University of Rostock,
More informationDistributing the Derivation and Maintenance of Subset Descriptor Rules
Distributing the Derivation and Maintenance of Subset Descriptor Rules Jerome Robinson, Barry G. T. Lowden, Mohammed Al Haddad Department of Computer Science, University of Essex Colchester, Essex, CO4
More informationADT 2010 ADT XQuery Updates in MonetDB/XQuery & Other Approaches to XQuery Processing
1 XQuery Updates in MonetDB/XQuery & Other Approaches to XQuery Processing Stefan Manegold Stefan.Manegold@cwi.nl http://www.cwi.nl/~manegold/ MonetDB/XQuery: Updates Schedule 9.11.1: RDBMS back-end support
More informationChild Prime Label Approaches to Evaluate XML Structured Queries
Child Prime Label Approaches to Evaluate XML Structured Queries Shtwai Abdullah Alsubai Department of Computer Science the University of Sheffield This thesis is submitted for the degree of Doctor of Philosophy
More informationPart V. SAX Simple API for XML. Torsten Grust (WSI) Database-Supported XML Processors Winter 2008/09 84
Part V SAX Simple API for XML Torsten Grust (WSI) Database-Supported XML Processors Winter 2008/09 84 Outline of this part 1 SAX Events 2 SAX Callbacks 3 SAX and the XML Tree Structure 4 SAX and Path Queries
More informationPart V. SAX Simple API for XML
Part V SAX Simple API for XML Torsten Grust (WSI) Database-Supported XML Processors Winter 2012/13 76 Outline of this part 1 SAX Events 2 SAX Callbacks 3 SAX and the XML Tree Structure 4 Final Remarks
More informationPublished by: PIONEER RESEARCH & DEVELOPMENT GROUP ( ) 1
A Conventional Query Processing using Wireless XML Broadcasting Subhashini.G 1, Kavitha.M 2 1 M.E II Year, Department of Computer Science and Engineering, Sriram Engineering College, Perumalpattu 602 024
More informationChapter 13 XML: Extensible Markup Language
Chapter 13 XML: Extensible Markup Language - Internet applications provide Web interfaces to databases (data sources) - Three-tier architecture Client V Application Programs Webserver V Database Server
More informationAdvanced Database Systems
Lecture IV Query Processing Kyumars Sheykh Esmaili Basic Steps in Query Processing 2 Query Optimization Many equivalent execution plans Choosing the best one Based on Heuristics, Cost Will be discussed
More informationNavigation- vs. Index-Based XML Multi-Query Processing
Navigation- vs. Index-Based XML Multi-Query Processing Nicolas Bruno, Luis Gravano Columbia University {nicolas,gravano}@cs.columbia.edu Nick Koudas, Divesh Srivastava AT&T Labs Research {koudas,divesh}@research.att.com
More informationAnswering XML Twig Queries with Automata
Answering XML Twig Queries with Automata Bing Sun, Bo Zhou, Nan Tang, Guoren Wang, Ge Yu, and Fulin Jia Northeastern University, Shenyang, China {sunb,wanggr,yuge,dbgroup}@mail.neu.edu.cn Abstract. XML
More informationAn approach to the model-based fragmentation and relational storage of XML-documents
An approach to the model-based fragmentation and relational storage of XML-documents Christian Süß Fakultät für Mathematik und Informatik, Universität Passau, D-94030 Passau, Germany Abstract A flexible
More informationXML and Databases. Lecture 10 XPath Evaluation using RDBMS. Sebastian Maneth NICTA and UNSW
XML and Databases Lecture 10 XPath Evaluation using RDBMS Sebastian Maneth NICTA and UNSW CSE@UNSW -- Semester 1, 2009 Outline 1. Recall pre / post encoding 2. XPath with //, ancestor, @, and text() 3.
More informationPathfinder/MonetDB: A High-Performance Relational Runtime for XQuery
Introduction Problems & Solutions Join Recognition Experimental Results Introduction GK Spring Workshop Waldau: Pathfinder/MonetDB: A High-Performance Relational Runtime for XQuery Database & Information
More informationOptimising XML RDF Data Integration
Optimising XML RDF Data Integration A Formal Approach to Improve XSPARQL Efficiency Stefan Bischof Siemens AG Österreich, Siemensstraße 90, 1210 Vienna, Austria bischof.stefan@siemens.com Abstract. The
More informationDDO-Free XQuery. Hiroyuki Kato 1, Yasunori Ishihara 2 and Torsten Grust 3
DDO-Free XQuery Hiroyuki Kato 1, Yasunori Ishihara 2 and Torsten Grust 3 1 National Institute of Informatics 2 Osaka University 3 Universität Tübingen The 16th International Symposium on Database Programming
More informationArchitecting Object Applications for High Performance with Relational Databases
Architecting Object Applications for High Performance with Relational Databases Shailesh Agarwal 1 Christopher Keene 2 Arthur M. Keller 3 1.0 Abstract This paper presents an approach for architecting OO
More informationA Compact and Scalable Encoding for Updating XML based on Node Labeling Schemes. Martin Francis O Connor
A Compact and Scalable Encoding for Updating XML based on Node Labeling Schemes Martin Francis O Connor Bachelor of Science (Hons) in Computer Applications Master of Science (Research) A Dissertation submitted
More informationSchemaless Approach of Mapping XML Document into Relational Database
Schemaless Approach of Mapping XML Document into Relational Database Ibrahim Dweib 1, Ayman Awadi 2, Seif Elduola Fath Elrhman 1, Joan Lu 1 University of Huddersfield 1 Alkhoja Group 2 ibrahim_thweib@yahoo.c
More informationPerformance Improvement of Hardware-Based Packet Classification Algorithm
Performance Improvement of Hardware-Based Packet Classification Algorithm Yaw-Chung Chen 1, Pi-Chung Wang 2, Chun-Liang Lee 2, and Chia-Tai Chan 2 1 Department of Computer Science and Information Engineering,
More informationCourse Description. Audience. Prerequisites. At Course Completion. : Course 40074A : Microsoft SQL Server 2014 for Oracle DBAs
Module Title Duration : Course 40074A : Microsoft SQL Server 2014 for Oracle DBAs : 4 days Course Description This four-day instructor-led course provides students with the knowledge and skills to capitalize
More informationCST-Trees: Cache Sensitive T-Trees
CST-Trees: Cache Sensitive T-Trees Ig-hoon Lee 1, Junho Shim 2, Sang-goo Lee 3, and Jonghoon Chun 4 1 Prompt Corp., Seoul, Korea ihlee@prompt.co.kr 2 Department of Computer Science, Sookmyung Women s University,
More informationAn Improvement of an Approach for Representation of Tree Structures in Relational Tables
An Improvement of an Approach for Representation of Tree Structures in Relational Tables Ivaylo Atanassov Abstract: The paper introduces an improvement of an approach for tree representation in relational
More informationTwigINLAB: A Decomposition-Matching-Merging Approach To Improving XML Query Processing
American Journal of Applied Sciences 5 (9): 99-25, 28 ISSN 546-9239 28 Science Publications TwigINLAB: A Decomposition-Matching-Merging Approach To Improving XML Query Processing Su-Cheng Haw and Chien-Sing
More informationTree-Pattern Queries on a Lightweight XML Processor
Tree-Pattern Queries on a Lightweight XML Processor MIRELLA M. MORO Zografoula Vagena Vassilis J. Tsotras Research partially supported by CAPES, NSF grant IIS 0339032, UC Micro, and Lotus Interworks Outline
More informationParameterized XPath Views
Parameterized XPath Views Timo Böhme, Erhard Rahm Database Group University of Leipzig {boehme,rahm}@informatik.uni-leipzig.de Abstract: We present a new approach for accelerating the execution of XPath
More informationMining XML data: A clustering approach
Mining XML data: A clustering approach Saraee, MH and Aljibouri, J Title Authors Type URL Published Date 2005 Mining XML data: A clustering approach Saraee, MH and Aljibouri, J Conference or Workshop Item
More informationXML and Databases. Outline. Outline - Lectures. Outline - Assignments. from Lecture 3 : XPath. Sebastian Maneth NICTA and UNSW
Outline XML and Databases Lecture 10 XPath Evaluation using RDBMS 1. Recall / encoding 2. XPath with //,, @, and text() 3. XPath with / and -sibling: use / size / level encoding Sebastian Maneth NICTA
More informationOn Label Stream Partition for Efficient Holistic Twig Join
On Label Stream Partition for Efficient Holistic Twig Join Bo Chen 1, Tok Wang Ling 1,M.TamerÖzsu2, and Zhenzhou Zhu 1 1 School of Computing, National University of Singapore {chenbo, lingtw, zhuzhenz}@comp.nus.edu.sg
More informationCopyright 2007 Ramez Elmasri and Shamkant B. Navathe. Slide 27-1
Slide 27-1 Chapter 27 XML: Extensible Markup Language Chapter Outline Introduction Structured, Semi structured, and Unstructured Data. XML Hierarchical (Tree) Data Model. XML Documents, DTD, and XML Schema.
More informationA Survey Of Algorithms Related To Xml Based Pattern Matching
A Survey Of Algorithms Related To Xml Based Pattern Matching Dr.R.Sivarama Prasad 1, D.Bujji Babu 2, Sk.Habeeb 3, Sd.Jasmin 4 1 Coordinator,International Business Studies, Acharya Nagarjuna University,Guntur,A.P,India,
More informationAn Implementation of Tree Pattern Matching Algorithms for Enhancement of Query Processing Operations in Large XML Trees
An Implementation of Tree Pattern Matching Algorithms for Enhancement of Query Processing Operations in Large XML Trees N. Murugesan 1 and R.Santhosh 2 1 PG Scholar, 2 Assistant Professor, Department of
More informationXML Query Processing and Optimization
XML Query Processing and Optimization Ning Zhang School of Computer Science University of Waterloo nzhang@uwaterloo.ca Abstract. In this paper, I summarize my research on optimizing XML queries. This work
More informationQuerying Tree-Structured Data Using Dimension Graphs
Querying Tree-Structured Data Using Dimension Graphs Dimitri Theodoratos 1 and Theodore Dalamagas 2 1 Dept. of Computer Science New Jersey Institute of Technology Newark, NJ 07102 dth@cs.njit.edu 2 School
More informationQuerying XML. COSC 304 Introduction to Database Systems. XML Querying. Example DTD. Example XML Document. Path Descriptions in XPath
COSC 304 Introduction to Database Systems XML Querying Dr. Ramon Lawrence University of British Columbia Okanagan ramon.lawrence@ubc.ca Querying XML We will look at two standard query languages: XPath
More informationType Based XML Projection
1/90, Type Based XML Projection VLDB 2006, Seoul, Korea Véronique Benzaken Dario Colazzo Giuseppe Castagna Kim Nguy ên : Équipe Bases de Données, LRI, Université Paris-Sud 11, Orsay, France : Équipe Langage,
More informationA Component Framework for HPC Applications
A Component Framework for HPC Applications Nathalie Furmento, Anthony Mayer, Stephen McGough, Steven Newhouse, and John Darlington Parallel Software Group, Department of Computing, Imperial College of
More informationTRIE BASED METHODS FOR STRING SIMILARTIY JOINS
TRIE BASED METHODS FOR STRING SIMILARTIY JOINS Venkat Charan Varma Buddharaju #10498995 Department of Computer and Information Science University of MIssissippi ENGR-654 INFORMATION SYSTEM PRINCIPLES RESEARCH
More informationNested Intervals Tree Encoding with Continued Fractions
Nested Intervals Tree Encoding with Continued Fractions VADIM TROPASHKO Oracle Corp There is nothing like abstraction To take away your intuition Shai Simonson http://aduniorg/courses/discrete/ We introduce
More informationSecurity Based Heuristic SAX for XML Parsing
Security Based Heuristic SAX for XML Parsing Wei Wang Department of Automation Tsinghua University, China Beijing, China Abstract - XML based services integrate information resources running on different
More informationXML and information exchange. XML extensible Markup Language XML
COS 425: Database and Information Management Systems XML and information exchange 1 XML extensible Markup Language History 1988 SGML: Standard Generalized Markup Language Annotate text with structure 1992
More informationXIST: An XML Index Selection Tool
XIST: An XML Index Selection Tool Kanda Runapongsa 1, Jignesh M. Patel 2, Rajesh Bordawekar 3, and Sriram Padmanabhan 3 1 krunapon@kku.ac.th Khon Kaen University, Khon Kaen 40002, Thailand 2 jignesh@eecs.umich.edu
More informationA Framework for Processing Complex Document-centric XML with Overlapping Structures Ionut E. Iacob and Alex Dekhtyar
A Framework for Processing Complex Document-centric XML with Overlapping Structures Ionut E. Iacob and Alex Dekhtyar ABSTRACT Management of multihierarchical XML encodings has attracted attention of a
More informationExtending CMIS Standard for XML Databases
Extending CMIS Standard for XML Databases Mihai Stancu * *Faculty of Mathematics and Computer Science, Department of Computer Science, University of Craiova, Romania (e-mail: mihai.stancu@yahoo.com) Abstract:
More informationXTrigger: XML database trigger
Comput Sci Res Dev (2014) 29:1 19 DOI 10.1007/s00450-010-0132-2 REGULAR PAPER XTrigger: XML database trigger Anders H. Landberg J. Wenny Rahayu Eric Pardede Received: 2 September 2009 / Accepted: 5 August
More information