Filters








3,436 Hits in 3.6 sec

Approximate Joins for Data-Centric XML

Nikolaus Augsten, Michael Bohlen, Curtis Dyreson, Johann Gamper
2008 2008 IEEE 24th International Conference on Data Engineering  
For XML data, most approximate join strategies are based on some ordered tree matching technique.  ...  But in data-centric XML the order is irrelevant: two elements should match even if their subelement order varies. In this paper we give a solution for the approximate join of unordered trees.  ...  Further we plan to combine our approximate join on datacentric XML with approximate string matching techniques.  ... 
doi:10.1109/icde.2008.4497490 dblp:conf/icde/AugstenBDG08 fatcat:bimz33kazncztnrtgwurqcbe2y

Efficient Mining of XML Query Patterns for Caching [chapter]

Liang Huai Yang, Mong Li Lee, Wynne Hsu
2003 Proceedings 2003 VLDB Conference  
In addition, we demonstrate how the frequent query patterns can be used to improve caching performance.  ...  As XML becomes ubiquitous, the efficient retrieval of XML data becomes critical. Research to improve query response time has been largely concentrated on indexing paths, and optimizing XML queries.  ...  Figure 6 . 6 G-QPT-Guided Enumeration. 3 ,- 1 . 31 us to simplify the join of two RSTs. We only need to compare the two RST's string encodings and find the first position where they differ.  ... 
doi:10.1016/b978-012722442-8/50015-x dblp:conf/vldb/YangLH03 fatcat:ozwndadawjdkzisezw4q5a6r2q

Synthetic data generation for the internet of things

Jason W. Anderson, K. E. Kennedy, Linh B. Ngo, Andre Luckow, Amy W. Apon
2014 2014 IEEE International Conference on Big Data (Big Data)  
There is a need for the development of infrastructure support and analytical tools to handle IoT data, which are naturally big and complex.  ...  ACKNOWLEDGMENT We would like to thank BMW for supporting this research. This work has been supported in part by NSF grant #1212680.  ...  data (e. g., XML/JSON format).  ... 
doi:10.1109/bigdata.2014.7004228 dblp:conf/bigdataconf/AndersonKNLA14 fatcat:xvp6qpsyire75bow6insgall7i

Extending Java for High-Level Web Service Construction

Aske Simon Christensen, Anders Møller, Michael I. Schwartzbach
2002 BRICS Report Series  
The resulting language, JWIG, contains an advanced session model and a flexible mechanism for dynamic construction of XML documents, in particular XHTML.  ...  <br /> <br />We compare JWIG with Servlets and JSP which are widely used Web service development platforms.  ...  This joining is similar to the technique used in [35] . Field variables.  ... 
doi:10.7146/brics.v9i11.21729 fatcat:oytoqydvxvayxkifji4acqsi74

Extending Java for high-level Web service construction

Aske Simon Christensen, Anders Møller, Michael I. Schwartzbach
2003 ACM Transactions on Programming Languages and Systems  
The resulting language, JWIG, contains an advanced session model and a flexible mechanism for dynamic construction of XML documents, in particular XHTML.  ...  We compare JWIG with Servlets and JSP which are widely used Web service development platforms.  ...  This joining is similar to the technique used in [35] . Field variables.  ... 
doi:10.1145/945885.945890 fatcat:xs6phj35bbajxj4kbpwqh4z4su

Static Analysis for Dynamic XML

Aske Simon Christensen, Anders Møller, Michael I. Schwartzbach
2002 BRICS Report Series  
We describe the summary graph lattice for dataflow analysis of programs that dynamically construct XML documents.  ...  Summary graphs have successfully been used to provide static guarantees in the JWIG language for programming interactive Web services.  ...  Conclusion We have presented the lattice of summary graphs as a convenient means for abstracting sets of XML values during dataflow analyses of programs that dynamically construct XML documents.  ... 
doi:10.7146/brics.v9i24.21740 fatcat:ly7cxpvqafevna4fbfkwyvdjbu

A survey on tree matching and XML retrieval

Mohammed Amin Tahraoui, Karen Pinel-Sauvagnat, Cyril Laitang, Mohand Boughanem, Hamamache Kheddouci, Lei Ning
2013 Computer Science Review  
exact and an approximate matching perspective.  ...  This study will allow us to highlight theoretical aspects of graph theory that have not been yet explored in XML retrieval.  ...  The structural join approach is mainly used for processing XML twig queries.  ... 
doi:10.1016/j.cosrev.2013.02.001 fatcat:6xnbgq4txvgxtnw35myadfmtkm

XML graphs in program analysis

Anders Møller, Michael I. Schwartzbach
2007 Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '07  
We also survey the use of XML graphs for program analysis with four very different languages: Xact (XML in Java), Java Servlets (Web application programming), XSugar (transformations between XML and non-XML  ...  data), and XSLT (stylesheets for transforming XML documents). .dk (A.  ...  Generally, least upper bound is an upper approximation of language union: XML graphs are also closed under language union: simply rename nodes to avoid conflicts and then join the root sets (gap names  ... 
doi:10.1145/1244381.1244383 dblp:conf/pepm/MollerS07 fatcat:a6c3ooa6wng77cqrb5qzifzdzi

XML graphs in program analysis

Anders Møller, Michael Schwartzbach
2011 Science of Computer Programming  
We also survey the use of XML graphs for program analysis with four very different languages: Xact (XML in Java), Java Servlets (Web application programming), XSugar (transformations between XML and non-XML  ...  data), and XSLT (stylesheets for transforming XML documents). .dk (A.  ...  Generally, least upper bound is an upper approximation of language union: XML graphs are also closed under language union: simply rename nodes to avoid conflicts and then join the root sets (gap names  ... 
doi:10.1016/j.scico.2009.11.007 fatcat:3ojdtal5j5ajtmfoofqlzs64zu

Windowed pq-grams for approximate joins of data-centric XML

Nikolaus Augsten, Michael Böhlen, Curtis Dyreson, Johann Gamper
2011 The VLDB journal  
The approximate join using windowed pq-grams can be efficiently implemented as an equality join on strings, which avoids the costly computation of the distance between every pair of input trees.  ...  For XML data, most existing approximate join strategies are based on some ordered tree matching technique, such as the tree edit distance.  ...  [44] for ordered pq-grams. Further, we plan to combine our approximate join on datacentric XML with approximate string-matching techniques.  ... 
doi:10.1007/s00778-011-0254-6 fatcat:7e2waxvy6rf6rb2uxkhfgo7b7y

A bi-labeling based XPath processing system

Yi Chen, Susan B. Davidson, Yifeng Zheng
2010 Information Systems  
XML data are stored in labeled form and indexed. Algorithms are presented for translating XPath queries to SQL expressions.  ...  XML data are stored in labeled form and indexed. Algorithms are presented for translating XPath queries to SQL expressions.  ...  In Georgiadis and Vassalos's work [26] , the source path of each XML node is recorded as a string and a path query is processed as a complex regular expression matching over strings.  ... 
doi:10.1016/j.is.2009.05.005 fatcat:3tmxixssena33kzjphxulpgkfi

A survey on tree edit distance lower bound estimation techniques for similarity join on XML data

Fei Li, Hongzhi Wang, Jianzhong Li, Hong Gao
2014 SIGMOD record  
Approximate join techniques are often used, in which similar trees are considered describing the same real-world object.  ...  When integrating tree-structured data from autonomous and heterogeneous sources, exact joins often fail for the same object may be represented differently.  ...  INTRODUCTION For the ability to represent data from heterogeneous sources, XML is widely used for web data representation and exchange.  ... 
doi:10.1145/2590989.2590994 fatcat:4chfbq72kzeazjvt7te7kjtml4

Efficiently Querying Large XML Data Repositories: A Survey

Gang Gou, Rada Chirkova
2007 IEEE Transactions on Knowledge and Data Engineering  
The relational approach directly utilizes existing relational database systems to store and query XML data, which enables the use of all important techniques that have been developed for relational databases  ...  There has been a growing need for developing high-performance techniques to query large XML data repositories efficiently.  ...  They also would like to thank the US National Science Foundation (NSF) for supporting this work under NSF Faculty Early Career Development (CAREER) Award 0447742 and NSF IIS Grant 0307072.  ... 
doi:10.1109/tkde.2007.1060 fatcat:kzmwqcla6rfyvakf4ctc5dwlwm

Query Optimization Techniques For Xml Databases

Su Cheng Haw, G. S. V. Radha Krishna Rao
2008 Zenodo  
This paper provides a kick-start for new researches venturing in XML databases field.  ...  We survey the storage representation for XML document, review the XML query processing and optimization techniques with respect to the particular storage instance.  ...  As a result, only approximation is used for answering longer queries [23] . This index graph is never larger than the source in size; however, it may not be precise.  ... 
doi:10.5281/zenodo.1058666 fatcat:tlozutxldvd3he3hv4smela2sq

Comparative Analysis of Five XML Query Languages [article]

Angela Bonifati, Stefano Ceri
1999 arXiv   pre-print
XML is becoming the most relevant new standard for data representation and exchange on the WWW.  ...  Novel languages for extracting and restructuring the XML content have been proposed, some in the tradition of database query languages (i.e. SQL, OQL), others more closely inspired by XML.  ...  We are particularly grateful to Jennifer and Jason for their extensive advices and significant contributions.  ... 
arXiv:cs/9912015v1 fatcat:y7rl6cds4veb5fm5iky2ztcutm
« Previous Showing results 1 — 15 out of 3,436 results