Filters








18,163 Hits in 7.3 sec

Complexity of Data Tree Patterns over XML Documents [chapter]

Claire David
Lecture Notes in Computer Science  
Data tree patterns are a simple and natural formalism for expressing properties of XML documents.  ...  We consider Boolean combinations of data tree patterns as a specification and query language for XML documents.  ...  Preliminary In this paper, we consider XML documents that are modeled as unordered, unranked data trees, as considered e.g. in [10] .  ... 
doi:10.1007/978-3-540-85238-4_22 fatcat:uugnksomnnf6hdrsofqzrrj27m

On the complexity of query answering over incomplete XML documents

Amélie Gheerbrant, Leonid Libkin, Tony Tan
2012 Proceedings of the 15th International Conference on Database Theory - ICDT '12  
The goal of this paper is to provide a complete picture of the complexity of query answering over incomplete XML documents.  ...  Previous studies of incomplete XML documents have identified three main sources of incompleteness -in structural information, data values, and labelingand addressed data complexity of answering analogs  ...  Over arbitrary incomplete trees under owa, for each of the languages UCQ xml , UCQ = xml , BCCQ xml , BCCQ = xml , data complexity is coNP-complete and combined complexity is Π p 2 -complete.  ... 
doi:10.1145/2274576.2274595 dblp:conf/icdt/GheerbrantLT12 fatcat:eed3jiriqbhxhjblhltds2role

Analytical processing of XML documents

Rajesh R. Bordawekar, Christian A. Lang
2005 SIGMOD record  
Need for analyzing XML documents is gaining urgency as XML has become the language of choice for data representation across a wide range of application domains.  ...  This paper describes a proposal for analyzing XML documents using the abstract XML tree model.  ...  The former specify text contents in an XML document (which can be values of XML attribute or text nodes), while the latter specify tree patterns in an XML document (and therefore represent a set of valid  ... 
doi:10.1145/1083784.1083790 fatcat:6hn6oseo3nepfope7szvlm5gte

Probabilistic XML: Models and Complexity [chapter]

Benny Kimelfeld, Pierre Senellart
2013 Studies in Fuzziness and Soft Computing  
In essence, a probabilistic XML document is a compact representation of a probability distribution over ordinary XML documents.  ...  Specifically, this chapter discusses the probabilistic XML models that have been proposed, and the complexity of query evaluation therein.  ...  ., what makes tree-pattern queries over ProTDB tractable, when they are encoded into relations?)  ... 
doi:10.1007/978-3-642-37509-5_3 fatcat:lcoqkx7euvfb3dietqvb6v3qva

XML data exchange

Marcelo Arenas, Leonid Libkin
2005 Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '05  
In this paper, we start looking into the basic properties of XML data exchange, that is, restructuring of XML documents that conform to a source DTD under a target DTD, and answering queries written over  ...  Furthermore, for all tractable cases we give polynomial-time algorithms that compute target XML documents over which queries can be answered.  ...  Part of this work was done while M. Arenas was at IBM Almaden.  ... 
doi:10.1145/1065167.1065171 dblp:conf/pods/ArenasL05 fatcat:7sbvhte7mnapxnp4w7uwdopz5e

Value joins are expensive over (probabilistic) XML

Evgeny Kharlamov, Werner Nutt, Pierre Senellart
2011 Proceedings of the 4th International Workshop on Logic in Databases - LID '11  
We address the cost of adding value joins to tree-pattern queries and monadic second-order queries over trees in terms of the tractability of query evaluation over two data models: XML and probabilistic  ...  For treepattern queries with joins (TPJ) the complexity jump is only on probabilistic XML, while for monadic second-order logic over trees with joins (TMSOJ) it already appears for deterministic XML documents  ...  CONCLUSION AND DIRECTIONS We studied complexity of query evaluation over XML and probabilistic XML for tree-pattern and monadic second-order queries with joins.  ... 
doi:10.1145/1966357.1966366 dblp:conf/lid/KharlamovNS11 fatcat:l5il7bxuffbvxgvva7bffbpojq

XML algebras for data mining

Ming Zhang, JingTao Yao, Belur V. Dasarathy
2004 Data Mining and Knowledge Discovery: Theory, Tools, and Technology VI  
Transformation of data map XML documents into instances of relational databases in order to use a traditional query language, 19, 20 Development of query language develop new query languages 2-4, 22 to  ...  We argue that by adding additional operators for mining tasks, XML algebras may work well for data mining with XML documents.  ...  Figure 1 . 1 An example of an XML document: pub.xml Figure 2 . 2 A query in XQuery to pub.xml Table 2 . 2 Complexity of tree inclusion problems  ... 
doi:10.1117/12.543826 dblp:conf/dmkdttt/ZhangY04 fatcat:4uhfaztwebhithgzksgkjohxce

Data Cleaning Model for XML Datasets using Conditional Dependencies

Mohammed Ragheb Hakawati, Yasmin Yacob, Rafikha Aliana A. Raof, Mustafa M.Khalifa Jabiry, Eiad Syaf Alhudiani
2020 European Journal of Electrical Engineering and Computer Science  
This research considered the final phase for a cleaning model introduced for XML datasets by firstly mapping the XML document to a set of related tables then discovering a set of conditional dependencies  ...  Detecting inconsistencies will be done by joining the existed data source with a set of patterns tableaus as conditional dependencies and then update these values to match the proper patterns using a set  ...  We also thank our colleagues from the University of Malaysia Perlis who provided insight and expertise that greatly assisted the research.  ... 
doi:10.24018/ejece.2020.4.1.163 fatcat:yi7hlhikcnhwlkrz3jqgm74bsi

XML Publish/Subscribe [chapter]

Michael Rys, Dongwon Lee, Ting Yu, Michael Rys, Denilson Barbosa, Ioana Manolescu, Jeffrey Xu Yu, Jayant R. Haritsa, Dan Suciu, Michael Rys, Michael Rys, Xin Luna Dong (+45 others)
2009 Encyclopedia of Database Systems  
model that directs the flow of messages from senders to receivers based on receivers' data interests.  ...  SYNONYMS Selective XML dissemination, XML filtering, XML message brokering DEFINITION As stated in the entry "Publish/Subscribe over Streams", publish/subscribe (pub/sub) is a many-to-many communication  ...  XML data, and the complexity of XML processing.  ... 
doi:10.1007/978-0-387-39940-9_785 fatcat:c6k3eh2dbzghnbpkmgrtefk3vu

An overview on XML similarity: Background, current trends and future directions

Joe Tekli, Richard Chbeir, Kokou Yetongnon
2009 Computer Science Review  
We also detail the possible applications of XML comparison processes in various fields, ranging over data warehousing, data integration, classification/clustering and XML querying, and discuss some required  ...  In recent years, XML has been established as a major means for information management, and has been broadly utilized for complex data representation (e.g. multimedia objects).  ...  path in an XML document (in number of nodes) P: cardinality of XML tree pattern K: maximum size (number of vertices) of a level in the pattern P Tr: cardinality of the target XML tree M: is the number  ... 
doi:10.1016/j.cosrev.2009.03.001 fatcat:c3mvd7her5ae3ohbip25c753b4

XML schema mappings

Shun'ichi Amano, Leonid Libkin, Filip Murlak
2009 Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '09  
Our goal is to develop a theory of expressive XML schema mappings. Such mappings should be able to use various forms of navigation in a document, and specify conditions on data values.  ...  Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amount of attention.  ...  The key idea of XML schema mappings defined in [4] was to extend the relational framework by viewing XML trees as databases over two sorts of objects: tree nodes, and data values.  ... 
doi:10.1145/1559795.1559801 dblp:conf/pods/AmanoLM09 fatcat:3fup3xxbdff2tkrikctmyf2uxi

Tractable XML data exchange via relations

Rada Chirkova, Leonid Libkin, Juan L. Reutter
2012 Frontiers of Computer Science  
We consider the problem of data exchange for XML documents: given source and target schemas, a mapping between them, and a document that conforms to the source schema, construct a target document and answer  ...  However, there is a complexity mismatch between query answering in relational and XML data exchange, which indicates that restrictions have to be imposed on XML schemas and mappings, as well as on XML  ...  Mappings for the XML data exchange problem were studied in [6, 4] ; these papers noticed that the complexity of many tasks in XML data exchange in higher than for their relational analogs, which suggests  ... 
doi:10.1007/s11704-012-2023-0 fatcat:u4js4cisrneallj2y4tb2t7iou

Tractable XML data exchange via relations

Rada Chirkova, Leonid Libkin, Juan L. Reutter
2011 Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11  
We consider the problem of data exchange for XML documents: given source and target schemas, a mapping between them, and a document that conforms to the source schema, construct a target document and answer  ...  However, there is a complexity mismatch between query answering in relational and XML data exchange, which indicates that restrictions have to be imposed on XML schemas and mappings, as well as on XML  ...  Mappings for the XML data exchange problem were studied in [6, 4] ; these papers noticed that the complexity of many tasks in XML data exchange in higher than for their relational analogs, which suggests  ... 
doi:10.1145/2063576.2063813 dblp:conf/cikm/ChirkovaLR11 fatcat:usalxtj4y5djfe5kfd3llrna6y

Automata- and Logic-Based Pattern Languages for Tree-Structured Data [chapter]

Frank Neven, Thomas Schwentick
2003 Lecture Notes in Computer Science  
This paper surveys work of the authors on pattern languages for tree-structured data with XML as the main application in mind. The main focus is on formalisms from formal language theory and logic.  ...  It investigates expressiveness as well as the complexity of query evaluation and some optimization problems. Finally, formalisms that allow comparison of attribute values are considered.  ...  Most of them allow a kind of pattern matching along paths in an XML document; some of them by means of regular expressions.  ... 
doi:10.1007/3-540-36596-6_9 fatcat:647wylabnjfshdr6opbrzxflna

A Framework for Efficient Association Rule Mining in XML Data

Ji Zhang, Han Liu, Tok Wang Ling, Robert M. Bruckner, A Min Tjoa
2006 Journal of Database Management  
In XAR-Miner, raw data in the XML document are first preprocessed to transform to either an Indexed XML Tree (IX-tree) or Multi-relational Databases (Multi-DB), depending on the size of XML document and  ...  The experiments conducted show that XAR-Miner is more efficient in performing a large number of AR mining tasks from XML documents than the state-of-the-art method of repetitively scanning through XML  ...  COMPLEXITY ANALYSIS In this part, we will empirically analyze the complexity of utilizing the IX-Tree/Multi-DB for AR mining.  ... 
doi:10.4018/jdm.2006070102 fatcat:fwer5d5bm5evzk2ph7ueun67we
« Previous Showing results 1 — 15 out of 18,163 results