Deferred node-copying scheme for XQuery processors
|
|
|
- Caroline Benson
- 10 years ago
- Views:
Transcription
1 Deferred node-copying scheme for XQuery processors Jan Kurš and Jan Vraný Software Engineering Group, FIT ČVUT, Kolejn 550/2, , Prague, Czech Republic Abstract. XQuery is generic, widely adopted language for querying and manipulating XML data. Many of currently available native XML databases are using XQuery as its primary query language. The XQuery specification requires each XML node to belong to exactly one XML tree. In case of the XML subtree is appended into a new XML structure, the whole subtree has to be copied and afterwards the copy is appended to the new structure. This may lead into excessive and unnecessary data copying and duplication. In this paper, we present a new XML node copying scheme that defers the node data copy operation unless necessary. We will show that this schemes significantly reduces the XML node copy operations required during the query processing. Keywords: XML, XQuery, XQuery Processor, Smalltalk 1 Introduction XQuery is an XML query language designed by the World Wide Web Consortium. Nowadays, almost every XML tool set or database vendor provides its own XQuery implementation. Although widely adopted, fast and efficient implementation is still lacking. Optimization techniques for XQuery are still a subject to an active research. XQuery evolves into a full-featured language. XML data could be not only queried, but also created using feature called element constructors. One particular problem deals with this feature. XQuery 1.0 and XPath 2.0 Data Model specification [1] forbids sharing of data model among multiple XML node hierarchies. Section 2.1 says:... Every node belongs to exactly one tree, and every tree has exactly one root node.... If a XML node is added into a new XML tree, the naive realization of this requirement would create a new node (by copying the original one) and the copy
2 1 let $authors = element authors { fn:doc("doc.xml")//authors } 2 let $titles = element titles { fn:doc("doc.xml")//titles } 3 return element result { $titles } Fig. 1. Simple document-creating query would be placed into the new XML tree. Consider the query at figure 1 is to be evaluated and its output is to be serialized to an output file. In this case, a whole XML subtree that matches fn:doc("doc.xml")//authors is never used. This may lead into excessive node copying depending on the subtree size. Consequently, such unnecessary copy operations leads into higher memory (or swap storage) consumption and thus badly affects overall performance. In this paper we will describe an efficient node-copying scheme that avoids unnecessary copying while preserving XQuery semantics. We will also discuss its correctness and benchmark results. The paper is organized as follows: section 2 give an overall description of the node-copying scheme mentioned above. Section 3 discusses experimental results based on running XMark benchmarks. Section 4 provides a brief overview of related work. Section 5 concludes by summarizing presented work. 2 Deferred Node-copying The basic idea is simple: share existing XML nodes between node hierarchies and defer node-copy operation unless absolutely inevitable. In our implementation the XML node can belong into multiple node hierarchies, but the XQuery specification requriement mentioned in section 1 is preserved. The deferred node copying scheme has been developed to meet two main goals: separate query processing logic from underlying physical data model and reduce memory consumption by preventing unnecessary data copying The first requirement has software engineering origin. XQuery is being considered as content integration language and thus XQuery processors should be able to operate over various data models, not necessarily XML-based. Moreover, good separation of query processor from physical data model provides possibility to use one XQuery implementation in multiple environments as a standalone XQuery tools or within a database management machine. The latter goals also came from practical needs. In case of large documents and complex queries, naive implementation of an XQuery may consume in edge cases twice more memory than actually needed. 2.1 XDM Adaptor XDM specification defines a sequence to be an instance of data model. Each sequence consists of zero or mode items. An item is either a node or atomic value.
3 The specification also defines a bunch of node properties such as dm:node-name or dm:parent. To meet our first goal we separates node from its physical data storage though an XDM adaptor which operates on so called node ids. Node id is an unique identifier of an XML node within particular physical storage. The structure of the node id is not defined in fact node id could be anything depending on the storage: reference to a DOM node in memory, pointer to a database file or simple integer. For given XDM property and node id, the XDM adaptor returns value of that property. For properties containing other node (such as dm:parent or dm:children), the adaptor returns node s node id. Usage of XDM adaptor give us relatively easy and straightforward way how to access different physical data models. The only requirement is to implement a new XDM adaptor object with 17 accessor methods corresponding with 17 properties defined by the XDM specification. The particular XDM adaptor astract any kind of data source and may use any kind of optimization (such as extensive caching) to access data effectively. However the physical data storage and access stategies are hidden to the rest of the XQuery processor. 2.2 Node States During query processing there are two kinds of nodes 1. First kind of nodes are such nodes, that comes from external data source (e.g., XML file or database). We call this nodes accessed nodes. More specifically, usage of XQuery functions fn:doc and fn:collection will result in collection of accessed nodes. Second kind of nodes are such nodes, that are created during query processing either by element constructors or as a copy of accessed node. We call this nodes constructed nodes. In order to defer copy operation, a new node property called node state is introduced. This property attached to every node regardless whether the node is accessed node or constructed node. Each node is in exactly one state from following three states: Accessed State. All accessed nodes are initially in accessed state. Constructed State. All nodes which are created during the query processing are in a constructed state. Hybrid State. Nodes which should be copied (according to XQuery specification), but the its copying is actually deferred are in a hybrid state. Nodes in hybrid state may have its dm:parent property temporarily overridden by another value. In fact, nodes in hybrid state may have two parents. We call nodes in hybrid state hybrid nodes. 1 Please note that these kinds has no relation to node kinds as defined by XDM specification, section 6.
4 2.3 Transitions During the query processing, the state of the node may change. The state diagram of the node is shown at figure 2. A state transition is triggered by an action issued on a particular node. There are three kinds of actions: Copy Action. The copy action is performed whenever the processor creates a copy of given node, as required by the XQuery specification. Change Action. The change action models any change in a data model such as setting a new parent. Child Read Action. The child read action represents the situation when the XQuery processor accesses child nodes of given node. The most common case includes XPath expression processing. Copy Copy Copy Child read Change/child read Hybrid Accessed error Constructed Change Change/child read Fig. 2. Node State Transitions 1 <?xml version="1.0"?> 2 <root> 3 <elem>elem1</elem> 4 <elem>elem2</elem> 5 </root> Fig. 3. doc.xml contents Consider a document doc.xml (it s content is shown at figure 3) and query 1 (figure 4). During execution of the query, following actions are performed:
5 1 element myroot { 2 attribute attr { value }, 3 fn:doc("doc.xml")/elem[0] 4 } Fig. 4. Example Query 1 1. The myroot element is created in the constructed state. Then three change actions are issued on that node: one for setting the node name to myroot, second for adding attribute attr and finally third for adding text node with value as a child node of attribute node. 2. Afterwards, the doc.xml is read and two child read actions are performed in order to evaluate XPath expression first on document node (which is initially in accessed state) and second on root element node (also initially in accessed state). 3. Finally, the first elem (accessed) node from doc.xml is to be added into the myroot (constructed) node. In that case, the elem node and all its descendants should be copied the XQuery processor issue a copy action on elem node. Instead of doing physical (deep) copy of given node, we change its state to the hybrid state and set a alternate parent node to myroot. None of nodes descendants are ever touched. Effectively, hybrid nodes are temporarily shared among multiple node hierarchies, as depicted at figure 5. Fig. 5. Two XML trees sharing one hybrid node In following sections we will give a more detailed discussion of state transitions. Accessed Node Transitions. As we said before, accessed node are nodes that comes from external data sources. When a copy of an accessed node is required, the node state is changed from accessed to hybrid and no physical data copy is made. Changes to accessed nodes are not permitted any change will immediately lead into an error. It s an XQuery processor responsibility not to try to change accessed nodes.
6 Constructed Node Transitions. Copy operations on constructed nodes behaves exactly as on accessed nodes. Changes to constructed nodes are permitted. Hybrid Node Transitions. Transitions based on actions on hybrid nodes are bit more interesting: Copy Action. Copy action on hybrid nodes is a no-op. As a result, the same node is returned with its state unchanged. Change Action. Whenever any of node properties is to be changed (its value is changed, new child node is added or removed, etc.), the node state is changed to constructed and all node properties are copied. The copy of a node is inevitable if data has changed. See the query at figure 6. When processing expression at line 5, two things happen (in that order): 1. The text node elem1 (a result of $doc/elem[0]/text() expression) is added to the myroot element. States of nodes after this addition are depicted at left side of figure Afterwards, the is the first text is to be appended to the (now hybrid) text node elem1. Because XQuery specification forbids two or more adjacent text nodes, value of XDM property of the text node is changed from string elem1 to elem1 is the first. Obviously, the hybrid text node must be copied. The XML data accessible though $doc must remain unchanged. Child Read Action. When a child read action is issued, the node state is changed to constructed, all node properties are copied and all its direct descendants are copied i.e., a copy action is performed for node children. The reason for such a behavior is the fact that the adaptor returns node ids for node-like properties and that the new (overridden) parent property value is not a part of underlying data model. Let s have an hybrid element node elem that contains accessed text node elem1. Suppose that./text()/../../.. expression is to be evaluated starting with hybrid node elem as the context node. Evaluation of such expression will result in repeated access to parent XDM property. Because the value parent property is obtained using XDM adaptor that operates only with node ids and because the overridden parent value for given node is maintained outside the primary data storage, there is no way how obtain correct (overridden) parent. To overcome this issue, we convert hybrid node to a constructed one on child read action. Such a behavior illustrated at figure 8. Data are physically copied only when hybrid node is either being changed or its children are being read. Serialization of Result Set. Once the query is processed, serialization of result set may not lead into XML node copying. Because query is already processed, no node kind transions must be performed during serialization and thus no node copies must be created. Obviously, if the application wants work with the result set as with nodes in memory and wants to perform some modification on it, the result set must be copied.
7 1 let $doc:= doc("doc.xml") 2 return 3 element myroot { 4 element myelem { 5 { $doc/elem[0]/text() } is the first 6 } 7 } Fig. 6. Example Query 2 Fig. 7. Change of hybrid node into the constructed node 3 Discussion 3.1 Specification Conformance Although deferred node-copying scheme does not require the XML nodes to belong to exactly one node hierarchy it preserves original XQuery semantics. Our claim is based on the results from the XQuery Test Suite [3]. The axes tests and element constructors tests from Minimal Conformance - Expressions section of XQTS Catalogue cover the node identity semantics and were used to test the correctness of deferred node-copying scheme. Our proofof-concept implementation successfully passes all the mentioned test cases. 3.2 Benchmarks Presented deferred node-copying scheme has been developed in order to increase XQuery processor performance by reducing number of copy operations. A natural question is whether this scheme has substantial effect in real-world applications. The table 3.2 shows number of copy operations for selected XMark [2] queries 2 on a file created with the XMark data generator. Number of saved copies is dependent on a query characteristics. There are no new nodes created in a Q1 command and that is why there is no difference in results. 2 Plus one nonstandard query marked INC. Its code is element a {doc("file:///auctions.xml") }. We include it as an illustration of extreme case.
8 Q. # DNC IC Q. # DNC IC N h N c N h N c N h N c N h N c Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q INC Legend: N h number of hybrid nodes created N c number of physically copied nodes DNC evaluated using deferred node-copying scheme IC evaluated using immediate copy as specified by the XQuery specification Table 1. Benchmark results
9 Fig. 8. Change of hybrid node while exploring the children On the other hand, there are text nodes appended to elements in a Q2 command. The number shows that all the text nodes does not need to be copied, only transformed to the hybrid state. Interesting results are provided by a Q13 command. There is a subtree appended to each result item during the query execution. Without the optimization, each element of a tree has to be copied. But if the optimization is turned on, only a few of nodes nodes has to be converted to the hybrid state and unnecessary copy of its sub-nodes is prevented. 4 Related Work exist XQuery Processor. exist 3 is an open-source XML-native database with XQuery as its primary query language. As far as we know, exist XQuery implementation unconditionally copies nodes whenever the node is to be added into a different node hierarchy. Our approach is different since we avoid unnecessary copy operations. Saxon XQuery Processor. Saxon 4 is well-known, widely adopted XML tool set including XSLT 2.0, XPath 2.0 and XQuery 1.0 processor. Saxon s XQuery processor introduces concept of virtual nodes a light-weigh node shallow copies that shares as many properties as possible with their origin. Similarly to our approach, for a given virtual node some of standard XDM properties may be overridden namely the parent property. When the Saxon XQuery processor iterates over virtual node s children, those are converted to virtual nodes. However, presented deferred node copying scheme differs from virtual nodes approach in several aspects: 1. Creating virtual copies requires a new object to be allocated in the memory. Deferred node copying scheme shares the same object
10 2. Creation of virtual copies is a part of XQuery processing logic and must be explicitly expressed, whereas our approach separates copying logic of an XDM model from the query evaluation logic. 5 Conclusion and Future Work This paper presents a deferred XML node-copying scheme for XQuery processors that significantly reduces number of source nodes copy operations required during query processing. This scheme defers the copy operation unless absolutely inevitable. Whether the node is actually copied depends on a node state, a new property which is maintained for each node in addition to standard XDM properties. Correctness of this approach has been successfully tested by XQuery Test Suite. The main benefits of deferred node-copying scheme are: (i) efficiency, (ii) easy to implement, (iii) independent on physical data model and (iv) independent on XQuery processing logic. As a future plan, we plan to extend this scheme for use with various XML indexing approaches, Ctree [4] and [5] in particular. References 1. M. N. Mary Fernández, Ashok Malhotra. Jonathan Marsh and N. Walsh. XQuery 1.0 and XPath 2.0 Data Model (XDM). W3C, 1st edition, A. Schmidt, F. Waas, M. Kersten, M. J. Carey, I. Manolescu, and R. Busse. Xmark: A benchmark for xml data management. In In VLDB, pages , W3C XML Query Working Group. XML Query Test Suite. W3C, 1st edition, Q. Zou, S. Liu, and W. W. Chu. Ctree: a compact tree for indexing xml data. In WIDM 04: Proceedings of the 6th annual ACM international workshop on Web information and data management, pages 39 46, New York, NY, USA, ACM. 5. Q. Zou, S. Liu, and W. W. Chu. Using a compact tree to index and query xml data. In CIKM 04: Proceedings of the thirteenth ACM international conference on Information and knowledge management, pages , New York, NY, USA, ACM.
Technologies for a CERIF XML based CRIS
Technologies for a CERIF XML based CRIS Stefan Bärisch GESIS-IZ, Bonn, Germany Abstract The use of XML as a primary storage format as opposed to data exchange raises a number of questions regarding the
Using Object And Object-Oriented Technologies for XML-native Database Systems
Using Object And Object-Oriented Technologies for XML-native Database Systems David Toth and Michal Valenta David Toth and Michal Valenta Dept. of Computer Science and Engineering Dept. FEE, of Computer
Caching XML Data on Mobile Web Clients
Caching XML Data on Mobile Web Clients Stefan Böttcher, Adelhard Türling University of Paderborn, Faculty 5 (Computer Science, Electrical Engineering & Mathematics) Fürstenallee 11, D-33102 Paderborn,
An XML Based Data Exchange Model for Power System Studies
ARI The Bulletin of the Istanbul Technical University VOLUME 54, NUMBER 2 Communicated by Sondan Durukanoğlu Feyiz An XML Based Data Exchange Model for Power System Studies Hasan Dağ Department of Electrical
CellStore: Educational and Experimental XML-Native DBMS
CellStore: Educational and Experimental XML-Native DBMS Jaroslav Pokorný 1 and Karel Richta 2 and Michal Valenta 3 1 Charles University of Prague, Czech Republic, [email protected] 2 Czech Technical
The BPM to UML activity diagram transformation using XSLT
The BPM to UML activity diagram transformation using XSLT Ondřej Macek 1 and Karel Richta 1,2 1 Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University,
Persistent Binary Search Trees
Persistent Binary Search Trees Datastructures, UvA. May 30, 2008 0440949, Andreas van Cranenburgh Abstract A persistent binary tree allows access to all previous versions of the tree. This paper presents
Indexing XML Data in RDBMS using ORDPATH
Indexing XML Data in RDBMS using ORDPATH Microsoft SQL Server 2005 Concepts developed by: Patrick O Neil,, Elizabeth O Neil, (University of Massachusetts Boston) Shankar Pal,, Istvan Cseri,, Oliver Seeliger,,
Managing large sound databases using Mpeg7
Max Jacob 1 1 Institut de Recherche et Coordination Acoustique/Musique (IRCAM), place Igor Stravinsky 1, 75003, Paris, France Correspondence should be addressed to Max Jacob ([email protected]) ABSTRACT
QuickDB Yet YetAnother Database Management System?
QuickDB Yet YetAnother Database Management System? Radim Bača, Peter Chovanec, Michal Krátký, and Petr Lukáš Radim Bača, Peter Chovanec, Michal Krátký, and Petr Lukáš Department of Computer Science, FEECS,
How To Use Query Console
Query Console User Guide 1 MarkLogic 8 February, 2015 Last Revised: 8.0-1, February, 2015 Copyright 2015 MarkLogic Corporation. All rights reserved. Table of Contents Table of Contents Query Console User
Data XML and XQuery A language that can combine and transform data
Data XML and XQuery A language that can combine and transform data John de Longa Solutions Architect DataDirect technologies [email protected] Mobile +44 (0)7710 901501 Data integration through
Semistructured data and XML. Institutt for Informatikk INF3100 09.04.2013 Ahmet Soylu
Semistructured data and XML Institutt for Informatikk 1 Unstructured, Structured and Semistructured data Unstructured data e.g., text documents Structured data: data with a rigid and fixed data format
Chapter 1: Introduction
Chapter 1: Introduction Database System Concepts, 5th Ed. See www.db book.com for conditions on re use Chapter 1: Introduction Purpose of Database Systems View of Data Database Languages Relational Databases
Application of XML Tools for Enterprise-Wide RBAC Implementation Tasks
Application of XML Tools for Enterprise-Wide RBAC Implementation Tasks Ramaswamy Chandramouli National Institute of Standards and Technology Gaithersburg, MD 20899,USA 001-301-975-5013 [email protected]
Wireless Sensor Networks Database: Data Management and Implementation
Sensors & Transducers 2014 by IFSA Publishing, S. L. http://www.sensorsportal.com Wireless Sensor Networks Database: Data Management and Implementation Ping Liu Computer and Information Engineering Institute,
Introduction to Service Oriented Architectures (SOA)
Introduction to Service Oriented Architectures (SOA) Responsible Institutions: ETHZ (Concept) ETHZ (Overall) ETHZ (Revision) http://www.eu-orchestra.org - Version from: 26.10.2007 1 Content 1. Introduction
GCE Computing. COMP3 Problem Solving, Programming, Operating Systems, Databases and Networking Report on the Examination.
GCE Computing COMP3 Problem Solving, Programming, Operating Systems, Databases and Networking Report on the Examination 2510 Summer 2014 Version: 1.0 Further copies of this Report are available from aqa.org.uk
Markup Languages and Semistructured Data - SS 02
Markup Languages and Semistructured Data - SS 02 http://www.pms.informatik.uni-muenchen.de/lehre/markupsemistrukt/02ss/ XPath 1.0 Tutorial 28th of May, 2002 Dan Olteanu XPath 1.0 - W3C Recommendation language
Symbol Tables. Introduction
Symbol Tables Introduction A compiler needs to collect and use information about the names appearing in the source program. This information is entered into a data structure called a symbol table. The
CS 2112 Spring 2014. 0 Instructions. Assignment 3 Data Structures and Web Filtering. 0.1 Grading. 0.2 Partners. 0.3 Restrictions
CS 2112 Spring 2014 Assignment 3 Data Structures and Web Filtering Due: March 4, 2014 11:59 PM Implementing spam blacklists and web filters requires matching candidate domain names and URLs very rapidly
Introduction to XML Applications
EMC White Paper Introduction to XML Applications Umair Nauman Abstract: This document provides an overview of XML Applications. This is not a comprehensive guide to XML Applications and is intended for
Efficient Mapping XML DTD to Relational Database
Efficient Mapping XML DTD to Relational Database Mohammed Adam Ibrahim Fakharaldien 1, Khalid Edris 2, Jasni Mohamed Zain 3, Norrozila Sulaiman 4 Faculty of Computer System and Software Engineering,University
Language Interface for an XML. Constructing a Generic Natural. Database. Rohit Paravastu
Constructing a Generic Natural Language Interface for an XML Database Rohit Paravastu Motivation Ability to communicate with a database in natural language regarded as the ultimate goal for DB query interfaces
Object Instance Profiling
Object Instance Profiling Lubomír Bulej 1,2, Lukáš Marek 1, Petr Tůma 1 Technical report No. 2009/7, November 2009 Version 1.0, November 2009 1 Distributed Systems Research Group, Department of Software
UML-based Test Generation and Execution
UML-based Test Generation and Execution Jean Hartmann, Marlon Vieira, Herb Foster, Axel Ruder Siemens Corporate Research, Inc. 755 College Road East Princeton NJ 08540, USA [email protected] ABSTRACT
Fig. 3. PostgreSQL subsystems
Development of a Parallel DBMS on the Basis of PostgreSQL C. S. Pan [email protected] South Ural State University Abstract. The paper describes the architecture and the design of PargreSQL parallel database
Glossary of Object Oriented Terms
Appendix E Glossary of Object Oriented Terms abstract class: A class primarily intended to define an instance, but can not be instantiated without additional methods. abstract data type: An abstraction
2) Write in detail the issues in the design of code generator.
COMPUTER SCIENCE AND ENGINEERING VI SEM CSE Principles of Compiler Design Unit-IV Question and answers UNIT IV CODE GENERATION 9 Issues in the design of code generator The target machine Runtime Storage
Quiz! Database Indexes. Index. Quiz! Disc and main memory. Quiz! How costly is this operation (naive solution)?
Database Indexes How costly is this operation (naive solution)? course per weekday hour room TDA356 2 VR Monday 13:15 TDA356 2 VR Thursday 08:00 TDA356 4 HB1 Tuesday 08:00 TDA356 4 HB1 Friday 13:15 TIN090
ON ANALYZING THE DATABASE PERFORMANCE FOR DIFFERENT CLASSES OF XML DOCUMENTS BASED ON THE USED STORAGE APPROACH
ON ANALYZING THE DATABASE PERFORMANCE FOR DIFFERENT CLASSES OF XML DOCUMENTS BASED ON THE USED STORAGE APPROACH Hagen Höpfner and Jörg Schad and Essam Mansour International University Bruchsal, Campus
Generic Log Analyzer Using Hadoop Mapreduce Framework
Generic Log Analyzer Using Hadoop Mapreduce Framework Milind Bhandare 1, Prof. Kuntal Barua 2, Vikas Nagare 3, Dynaneshwar Ekhande 4, Rahul Pawar 5 1 M.Tech(Appeare), 2 Asst. Prof., LNCT, Indore 3 ME,
What is Data Virtualization?
What is Data Virtualization? Rick F. van der Lans Data virtualization is receiving more and more attention in the IT industry, especially from those interested in data management and business intelligence.
Creating Synthetic Temporal Document Collections for Web Archive Benchmarking
Creating Synthetic Temporal Document Collections for Web Archive Benchmarking Kjetil Nørvåg and Albert Overskeid Nybø Norwegian University of Science and Technology 7491 Trondheim, Norway Abstract. In
A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and:
Binary Search Trees 1 The general binary tree shown in the previous chapter is not terribly useful in practice. The chief use of binary trees is for providing rapid access to data (indexing, if you will)
Mapping Data to Queries: Semantics of the IS-A Rule
Mapping Data to Queries: Semantics of the IS-A Rule Martin Hentschel Donald Kossmann Tim Kraska Systems Group, ETH Zurich {firstname.lastname}@inf.ethz.ch Jonas Rutishauser ETH Zurich [email protected] Daniela
Visual C# 2012 Programming
Visual C# 2012 Programming Karli Watson Jacob Vibe Hammer John D. Reid Morgan Skinner Daniel Kemper Christian Nagel WILEY John Wiley & Sons, Inc. INTRODUCTION xxxi CHAPTER 1: INTRODUCING C# 3 What Is the.net
Optimization of SQL Queries in Main-Memory Databases
Optimization of SQL Queries in Main-Memory Databases Ladislav Vastag and Ján Genči Department of Computers and Informatics Technical University of Košice, Letná 9, 042 00 Košice, Slovakia [email protected]
How To Create A Data Transformation And Data Visualization Tool In Java (Xslt) (Programming) (Data Visualization) (Business Process) (Code) (Powerpoint) (Scripting) (Xsv) (Mapper) (
A Generic, Light Weight, Pluggable Data Transformation and Visualization Tool for XML to XML Transformation Rahil A. Khera 1, P. S. Game 2 1,2 Pune Institute of Computer Technology, Affiliated to SPPU,
IMPROVING PERFORMANCE OF RANDOMIZED SIGNATURE SORT USING HASHING AND BITWISE OPERATORS
Volume 2, No. 3, March 2011 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info IMPROVING PERFORMANCE OF RANDOMIZED SIGNATURE SORT USING HASHING AND BITWISE
An Approach to Translate XSLT into XQuery
An Approach to Translate XSLT into XQuery Albin Laga, Praveen Madiraju and Darrel A. Mazzari Department of Mathematics, Statistics, and Computer Science Marquette University P.O. Box 1881, Milwaukee, WI
root node level: internal node edge leaf node CS@VT Data Structures & Algorithms 2000-2009 McQuain
inary Trees 1 A binary tree is either empty, or it consists of a node called the root together with two binary trees called the left subtree and the right subtree of the root, which are disjoint from each
Full and Complete Binary Trees
Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full
Unified XML/relational storage March 2005. The IBM approach to unified XML/relational databases
March 2005 The IBM approach to unified XML/relational databases Page 2 Contents 2 What is native XML storage? 3 What options are available today? 3 Shred 5 CLOB 5 BLOB (pseudo native) 6 True native 7 The
SyncML Device Management
SyncML Device Management An overview and toolkit implementation Radu State Ph.D. The MADYNES Research Team LORIA INRIA Lorraine 615, rue du Jardin Botanique 54602 Villers-lès-Nancy France [email protected]
ProTrack: A Simple Provenance-tracking Filesystem
ProTrack: A Simple Provenance-tracking Filesystem Somak Das Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology [email protected] Abstract Provenance describes a file
æ A collection of interrelated and persistent data èusually referred to as the database èdbèè.
CMPT-354-Han-95.3 Lecture Notes September 10, 1995 Chapter 1 Introduction 1.0 Database Management Systems 1. A database management system èdbmsè, or simply a database system èdbsè, consists of æ A collection
Merkle Hash Trees for Distributed Audit Logs
Merkle Hash Trees for Distributed Audit Logs Subject proposed by Karthikeyan Bhargavan [email protected] April 7, 2015 Modern distributed systems spread their databases across a large number
Hardware Assisted Virtualization
Hardware Assisted Virtualization G. Lettieri 21 Oct. 2015 1 Introduction In the hardware-assisted virtualization technique we try to execute the instructions of the target machine directly on the host
OWL based XML Data Integration
OWL based XML Data Integration Manjula Shenoy K Manipal University CSE MIT Manipal, India K.C.Shet, PhD. N.I.T.K. CSE, Suratkal Karnataka, India U. Dinesh Acharya, PhD. ManipalUniversity CSE MIT, Manipal,
Simple Network Management Protocol
56 CHAPTER Chapter Goals Discuss the SNMP Management Information Base. Describe SNMP version 1. Describe SNMP version 2. Background The (SNMP) is an application layer protocol that facilitates the exchange
Blog Post Extraction Using Title Finding
Blog Post Extraction Using Title Finding Linhai Song 1, 2, Xueqi Cheng 1, Yan Guo 1, Bo Wu 1, 2, Yu Wang 1, 2 1 Institute of Computing Technology, Chinese Academy of Sciences, Beijing 2 Graduate School
ABSTRACT 1. INTRODUCTION. Kamil Bajda-Pawlikowski [email protected]
Kamil Bajda-Pawlikowski [email protected] Querying RDF data stored in DBMS: SPARQL to SQL Conversion Yale University technical report #1409 ABSTRACT This paper discusses the design and implementation
What's new in 3.0 (XSLT/XPath/XQuery) (plus XML Schema 1.1) Michael Kay Saxonica
What's new in 3.0 (XSLT/XPath/XQuery) (plus XML Schema 1.1) Michael Kay Saxonica XSD 1.1 Now a Proposed Recommendation Which means it's waiting for final approval by the W3C Advisory Committee and the
1. Domain Name System
1.1 Domain Name System (DNS) 1. Domain Name System To identify an entity, the Internet uses the IP address, which uniquely identifies the connection of a host to the Internet. However, people prefer to
Integrating Pattern Mining in Relational Databases
Integrating Pattern Mining in Relational Databases Toon Calders, Bart Goethals, and Adriana Prado University of Antwerp, Belgium {toon.calders, bart.goethals, adriana.prado}@ua.ac.be Abstract. Almost a
Easy configuration of NETCONF devices
Easy configuration of NETCONF devices David Alexa 1 Tomas Cejka 2 FIT, CTU in Prague CESNET, a.l.e. Czech Republic Czech Republic [email protected] [email protected] Abstract. It is necessary for developers
Co-Creation of Models and Metamodels for Enterprise. Architecture Projects.
Co-Creation of Models and Metamodels for Enterprise Architecture Projects Paola Gómez [email protected] Hector Florez [email protected] ABSTRACT The linguistic conformance and the ontological
XML Programming with PHP and Ajax
http://www.db2mag.com/story/showarticle.jhtml;jsessionid=bgwvbccenyvw2qsndlpskh0cjunn2jvn?articleid=191600027 XML Programming with PHP and Ajax By Hardeep Singh Your knowledge of popular programming languages
Grid Data Integration based on Schema-mapping
Grid Data Integration based on Schema-mapping Carmela Comito and Domenico Talia DEIS, University of Calabria, Via P. Bucci 41 c, 87036 Rende, Italy {ccomito, talia}@deis.unical.it http://www.deis.unical.it/
Fast Sequential Summation Algorithms Using Augmented Data Structures
Fast Sequential Summation Algorithms Using Augmented Data Structures Vadim Stadnik [email protected] Abstract This paper provides an introduction to the design of augmented data structures that offer
Object Oriented Database Management System for Decision Support System.
International Refereed Journal of Engineering and Science (IRJES) ISSN (Online) 2319-183X, (Print) 2319-1821 Volume 3, Issue 6 (June 2014), PP.55-59 Object Oriented Database Management System for Decision
A Comparative Study on Vega-HTTP & Popular Open-source Web-servers
A Comparative Study on Vega-HTTP & Popular Open-source Web-servers Happiest People. Happiest Customers Contents Abstract... 3 Introduction... 3 Performance Comparison... 4 Architecture... 5 Diagram...
Sorting Hierarchical Data in External Memory for Archiving
Sorting Hierarchical Data in External Memory for Archiving Ioannis Koltsidas School of Informatics University of Edinburgh [email protected] Heiko Müller School of Informatics University of Edinburgh
XML and Data Integration
XML and Data Integration Week 11-12 Week 11-12 MIE253-Consens 1 Schedule Week Date Lecture Topic 1 Jan 9 Introduction to Data Management 2 Jan 16 The Relational Model 3 Jan. 23 Constraints and SQL DDL
Software documentation systems
Software documentation systems Basic introduction to various user-oriented and developer-oriented software documentation systems. Ondrej Holotnak Ondrej Jombik Software documentation systems: Basic introduction
What mathematical optimization can, and cannot, do for biologists. Steven Kelk Department of Knowledge Engineering (DKE) Maastricht University, NL
What mathematical optimization can, and cannot, do for biologists Steven Kelk Department of Knowledge Engineering (DKE) Maastricht University, NL Introduction There is no shortage of literature about the
Structural Design Patterns Used in Data Structures Implementation
Structural Design Patterns Used in Data Structures Implementation Niculescu Virginia Department of Computer Science Babeş-Bolyai University, Cluj-Napoca email address: [email protected] November,
A JDF-enabled Workflow Simulation Tool
A JDF-enabled Workflow Simulation Tool Claes Buckwalter Keywords: Workflow, software framework, simulation, JDF Abstract: Job Definition Format (JDF) is a relatively young industry standard that specifies
Resource Allocation Schemes for Gang Scheduling
Resource Allocation Schemes for Gang Scheduling B. B. Zhou School of Computing and Mathematics Deakin University Geelong, VIC 327, Australia D. Walsh R. P. Brent Department of Computer Science Australian
Agents and Web Services
Agents and Web Services ------SENG609.22 Tutorial 1 Dong Liu Abstract: The basics of web services are reviewed in this tutorial. Agents are compared to web services in many aspects, and the impacts of
High Performance XML Data Retrieval
High Performance XML Data Retrieval Mark V. Scardina Jinyu Wang Group Product Manager & XML Evangelist Oracle Corporation Senior Product Manager Oracle Corporation Agenda Why XPath for Data Retrieval?
KEYWORD SEARCH IN RELATIONAL DATABASES
KEYWORD SEARCH IN RELATIONAL DATABASES N.Divya Bharathi 1 1 PG Scholar, Department of Computer Science and Engineering, ABSTRACT Adhiyamaan College of Engineering, Hosur, (India). Data mining refers to
File Systems Management and Examples
File Systems Management and Examples Today! Efficiency, performance, recovery! Examples Next! Distributed systems Disk space management! Once decided to store a file as sequence of blocks What s the size
Chapter 13 File and Database Systems
Chapter 13 File and Database Systems Outline 13.1 Introduction 13.2 Data Hierarchy 13.3 Files 13.4 File Systems 13.4.1 Directories 13.4. Metadata 13.4. Mounting 13.5 File Organization 13.6 File Allocation
Chapter 13 File and Database Systems
Chapter 13 File and Database Systems Outline 13.1 Introduction 13.2 Data Hierarchy 13.3 Files 13.4 File Systems 13.4.1 Directories 13.4. Metadata 13.4. Mounting 13.5 File Organization 13.6 File Allocation
LDIF - Linked Data Integration Framework
LDIF - Linked Data Integration Framework Andreas Schultz 1, Andrea Matteini 2, Robert Isele 1, Christian Bizer 1, and Christian Becker 2 1. Web-based Systems Group, Freie Universität Berlin, Germany [email protected],
[MS-ASMS]: Exchange ActiveSync: Short Message Service (SMS) Protocol
[MS-ASMS]: Exchange ActiveSync: Short Message Service (SMS) Protocol Intellectual Property Rights Notice for Open Specifications Documentation Technical Documentation. Microsoft publishes Open Specifications
Scalable Data Integration by Mapping Data to Queries
Scalable Data Integration by Mapping Data to Queries Martin Hentschel 1, Donald Kossmann 1, Daniela Florescu 2, Laura Haas 3, Tim Kraska 1, and Renée J. Miller 4 1 Systems Group, Department of Computer
1 Organization of Operating Systems
COMP 730 (242) Class Notes Section 10: Organization of Operating Systems 1 Organization of Operating Systems We have studied in detail the organization of Xinu. Naturally, this organization is far from
Teldat Router. DNS Client
Teldat Router DNS Client Doc. DM723-I Rev. 10.00 March, 2003 INDEX Chapter 1 Domain Name System...1 1. Introduction...2 2. Resolution of domains...3 2.1. Domain names resolver functionality...4 2.2. Functionality
Search help. More on Office.com: images templates
Page 1 of 14 Access 2010 Home > Access 2010 Help and How-to > Getting started Search help More on Office.com: images templates Access 2010: database tasks Here are some basic database tasks that you can
Optional custom API wrapper. C/C++ program. M program
GT.M GT.M includes a robust, high performance, multi-paradigm, open-architecture database. Relational, object-oriented and hierarchical conceptual models can be simultaneously applied to the same data
DIRECTOR GENERAL OF THE LITHUANIAN ARCHIVES DEPARTMENT UNDER THE GOVERNMENT OF THE REPUBLIC OF LITHUANIA
Non-official translation DIRECTOR GENERAL OF THE LITHUANIAN ARCHIVES DEPARTMENT UNDER THE GOVERNMENT OF THE REPUBLIC OF LITHUANIA ORDER ON THE CONFIRMATION OF THE SPECIFICATION ADOC-V1.0 OF THE ELECTRONIC
Lecture 7: Concurrency control. Rasmus Pagh
Lecture 7: Concurrency control Rasmus Pagh 1 Today s lecture Concurrency control basics Conflicts and serializability Locking Isolation levels in SQL Optimistic concurrency control Transaction tuning Transaction
LabVIEW Internet Toolkit User Guide
LabVIEW Internet Toolkit User Guide Version 6.0 Contents The LabVIEW Internet Toolkit provides you with the ability to incorporate Internet capabilities into VIs. You can use LabVIEW to work with XML documents,
Purely Relational XQuery
Purely Relational XQuery Database-Supported XML Processors Torsten Grust http://www-db.in.tum.de/~grust/ LUG Erding, Oct 2007 A Database Guy s View of XML, XPath, and XQuery 2 A Database Guy s View of
Checking Access to Protected Members in the Java Virtual Machine
Checking Access to Protected Members in the Java Virtual Machine Alessandro Coglio Kestrel Institute 3260 Hillview Avenue, Palo Alto, CA 94304, USA Ph. +1-650-493-6871 Fax +1-650-424-1807 http://www.kestrel.edu/
Introduction. What is RAID? The Array and RAID Controller Concept. Click here to print this article. Re-Printed From SLCentral
Click here to print this article. Re-Printed From SLCentral RAID: An In-Depth Guide To RAID Technology Author: Tom Solinap Date Posted: January 24th, 2001 URL: http://www.slcentral.com/articles/01/1/raid
