1,866 Hits in 6.3 sec


Hua-Gang Li, S. Alireza Aghili, Divyakant Agrawal, Amr El Abbadi
2006 Proceedings of the 15th international conference on World Wide Web - WWW '06  
In order to handle content and structure range queries efficiently, an XML query processing engine needs to incorporate effective indexing and summarization techniques to efficiently partition the XML  ...  An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures.  ...  Due to the heterogeneity of the XML data, it is essential to provide the support for fuzzy matching in current XML query engines.  ... 
doi:10.1145/1135777.1136025 dblp:conf/www/LiAAA06 fatcat:6alubwtu6veoji2tl33lwbkthu

An Algebra for Fuzzy Spatiotemporal Data in XML

Luyi Bai, Lin Zhu
2019 IEEE Access  
A formal algebra is essential for applying standard database-style query optimization to XML queries. We develop such algebra for manipulating fuzzy spatiotemporal XML data.  ...  It shows that the algebra can lay a firm foundation for managing fuzzy spatiotemporal XML data. INDEX TERMS Algebra, fuzzy spatiotemporal data, XML.  ...  Compared with their work, our model and algebra are well defined and powerful enough to support tree patterns, order-sensitive fuzzy spatiotemporal XML queries. IX.  ... 
doi:10.1109/access.2019.2898228 fatcat:7ty5c6kinfejbciunjbst5bzzu

Web Queries: From a Web of Data to a Semantic Web [chapter]

François Bry, Tim Furche, Klara Weiand
2009 Lecture Notes in Computer Science  
programmed Matching often fuzzy or vague only precise answers Return value Documents (or summaries thereof) parts of trees or graphs ordered tree (sometimes graph), mostly uniform edges XML  ...  How big must complete XML query languages be? ICDT 2009. XPath: Navigation in Trees A Success Story (cont.)  ...  Queries as Keywords  ... 
doi:10.1007/978-3-642-04409-0_5 fatcat:edjvavmx6jftjftcfetdbleuwm

Querying and Updating Probabilistic Information in XML [chapter]

Serge Abiteboul, Pierre Senellart
2006 Lecture Notes in Computer Science  
Our model supports both querying (tree pattern queries with join) and updating (transactions containing an arbitrary set of insertions and deletions) over probabilistic tree data.  ...  We present in this paper a new model for representing probabilistic information in a semi-structured (XML) database, based on the use of probabilistic event variables.  ...  -The query evaluation over fuzzy trees is implemented using the Qizx/open Java XQuery engine [12] .  ... 
doi:10.1007/11687238_62 fatcat:7osiee6ut5eg7p6jppp3z2nvcq

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.  ...  Note that a tree pattern ignores the order among siblings in a document. (Queries that take sibling order into account will be discussed in the next section.) Example 2. Four tree patterns, t 1 ,...  ... 
doi:10.1007/978-3-642-37509-5_3 fatcat:lcoqkx7euvfb3dietqvb6v3qva

A Fuzzy Extension for the XPath Query Language [chapter]

Alessandro Campi, Sam Guinea, Paola Spoletini
2006 Lecture Notes in Computer Science  
XML has become a widespread format for data exchange over the Internet.  ...  In this paper we describe a XML querying framework, called FuzzyXPath, based on Fuzzy Set Theory, relying on fuzzy conditions for the definition of flexible constraints on stored data.  ...  An early approach [11] was based on fuzzy encoding of XML data trees.  ... 
doi:10.1007/11766254_18 fatcat:ojeh6w7l7zb7tglwswdzcb54jm

The Continued Saga of DB-IR Integration [chapter]

Ricardo Baeza-Yates, Mariano Consens
2004 Proceedings 2004 VLDB Conference  
" A collection of data trees (C) A collection of scored data trees A scored pattern tree ( p ) SCORED SELECTION A collection of data trees (C) ) ( ' , C L ! !  ...  XQuery XPath 1.0 Lorel Patterns XSLT XSL XQL 98 XQ L 99 XPath 2.0 XQL 98 XML Query Data Model • Joint with XPath 2.0, XSL 2.0 -Last version of Feb 2004 • Ordered, labeled  ... 
doi:10.1016/b978-012088469-8.50118-2 dblp:conf/vldb/Baeza-YatesC04 fatcat:2lzk6qlgurgbdoj6do2qtxy2za

The Continued Saga of DB-IR Integration [chapter]

2004 Proceedings 2004 VLDB Conference  
" A collection of data trees (C) A collection of scored data trees A scored pattern tree ( p ) SCORED SELECTION A collection of data trees (C) ) ( ' , C L ! !  ...  XQuery XPath 1.0 Lorel Patterns XSLT XSL XQL 98 XQ L 99 XPath 2.0 XQL 98 XML Query Data Model • Joint with XPath 2.0, XSL 2.0 -Last version of Feb 2004 • Ordered, labeled  ... 
doi:10.1016/b978-012088469-8/50118-2 fatcat:dktiusnpj5hcfbu2fopto7psqq

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  
Although retrieving XML documents can be considered as a tree matching problem between the query tree and the document trees, only a few approaches take advantage of the algorithms and methods proposed  ...  In this paper, we aim at studying the theoretical approaches proposed in the literature for tree matching and at seeing how these approaches have been adapted to XML querying and retrieval, from both an  ...  Efficient methods for storing, indexing and querying XML data are therefore required. Ranking answers may also be of interest to solve the many-answers problem.  ... 
doi:10.1016/j.cosrev.2013.02.001 fatcat:6xnbgq4txvgxtnw35myadfmtkm

Querying Spatiotemporal Data Based on XML Twig Pattern

Luyi Bai, Yin Li, Jiemin Liu
2016 Journal of Software  
XML, as a standard language of information exchanging over the Web, has the ability to query spatiotemporal data.  ...  In this paper, we propose an algorithm, TwigStackSP, for matching a spatiotemporal XML query twig pattern.  ...  partial and total answers to the query twig pattern.  ... 
doi:10.17706/jsw.11.12.1199-1206 fatcat:gvxrwpu7lvgrtgyec7pohnbz74

Fuzzy XPath for the Automatic Search of Fuzzy Formulae Models [chapter]

Jesús M. Almendros-Jiménez, Miquel Bofill, Alejandro Luna-Tedesqui, Ginés Moreno, Carlos Vázquez, Mateu Villaret
2015 Lecture Notes in Computer Science  
Next, we use the ability of the FuzzyXPath tool (developed in our research group with FLOPER) for exploring these derivation trees once exported in XML format, in order to discover whether the formula  ...  We re-use a previous method based on fuzzy logic programming where the formula is conceived as a goal whose derivation tree, provided by our FLOPER tool, contains on its leaves all the models of the original  ...  analyzing derivation trees exported by FLOPER in XML format in order to help the analysis of fuzzy logic computations.  ... 
doi:10.1007/978-3-319-23540-0_26 fatcat:5lxjthni3vcfjedgcd5ktfovve

Efficiently Querying Large XML Data Repositories: A Survey

Gang Gou, Rada Chirkova
2007 IEEE Transactions on Knowledge and Data Engineering  
One important problem in XML query processing is twig pattern matching, that is, finding in an XML data tree D all matches that satisfy a specified twig (or path) query pattern Q.  ...  Index Terms-XML query processing, twig pattern matching.  ...  Data Model Basic Model: Trees The basic data model of XML is a labeled and ordered tree.  ... 
doi:10.1109/tkde.2007.1060 fatcat:kzmwqcla6rfyvakf4ctc5dwlwm

Twig Patterns: From XML Trees to Graphs

Benny Kimelfeld, Yehoshua Sagiv
2006 International Workshop on the Web and Databases  
Existing approaches for querying XML (e.g., XPath and twig patterns) assume that the data form a tree. Often, however, XML documents have a graph structure, due to ID references.  ...  For a wide range of ranking functions, it is possible to generate answers in ranked order with polynomial delay, under query-and-data complexity. This result holds even if projection is used.  ...  We now describe twig patterns and their conventional evaluation over XML graphs. A twig is a directed tree T with child edges and descendant edges.  ... 
dblp:conf/webdb/KimelfeldS06 fatcat:ocdxub2l3jeujgblh35jvvcgim

Design and Development of XML Data Salvage with Semantic Scrutiny and Query Enlargement

S. Ravichandran, J. Sunitha John
2020 Asian Journal of Science and Applied Technology  
Inquiry dialects require the information about the record pattern. Watchword based inquiry models does not requires the earlier information about the XML record structure.  ...  Fluffy sort ahead inquiry in XML information conspire is applied to look XML reports with question catchphrase.  ...  Answering Queries with a single keyword We first examination how to answer a question with a solitary watchword utilizing the tree structure.  ... 
doi:10.51983/ajsat-2020.9.1.1049 fatcat:lgl35mb7nffpfgrn2jgxhdlipe

An Effective Parallel XML Fuzzy Query Processing

K. NareshKumar, N. V. E. S Murthy, Ch. Satyanand Reddy
2014 International Journal of Computer Applications  
Parallel Path Stack algorithm speed XML Query processing performance significantly. Keywords XML, Fuzzy logic, X-PATH, fuzzy query, Fuzzy metaknowledge base.  ...  Our system is based on traditional XML databases, while permitting the storage of fuzzy data as well as crisp data.  ...  The query language is worked on the basis of XPATH mode permitting users to query fuzzy and crisp data over the database.  ... 
doi:10.5120/15012-3294 fatcat:5rzsbbg4kvdtnma74evg5qwcgu
« Previous Showing results 1 — 15 out of 1,866 results