A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
SAIL: Structure-aware indexing for effective and progressive top-k keyword search over XML documents
2009
Information Sciences
Preserved Fulltext
We develop a novel method, called SAIL, to index such structural relationships for efficient XML keyword search. ...
We propose the concept of minimal-cost trees to answer keyword queries and devise structure-aware indices to maintain the structural relationships for efficiently identifying the minimal-cost trees. ...
Indexing construction We develop an efficient stack-based method to identify the pivotal paths using a single-pass over the XML document. We traverse the XML document tree in pre-order. ...
doi:10.1016/j.ins.2009.06.025
fatcat:twn5qgacmrcrlht63uwgdxqpgy
Efficient Querying Distributed Big-XML Data using MapReduce
2016
International Journal of Grid and High Performance Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The authors' solution seamlessly integrates data storage, labeling, indexing, and parallel queries to process a massive amount of XML data. ...
More importantly, an advanced two-phase MapReduce solution are designed that is able to efficiently address the issues of labeling, indexing, and query processing on big XML data. ...
The Dewey label of a node u is a concatenation of all its ancestor nodes' local label on the path from the document root to v. Much attention has been paid to keywords searching on XML files. ...
doi:10.4018/ijghpc.2016070105
fatcat:d5y3noy23rfbdkgxrdi5eicujm
An Object-Oriented Approach of Keyword Querying over Fuzzy XML
2016
Journal of Computing and Information Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
To overcome these limitations, in this paper, we investigate how to obtain more comprehensive and meaningful results of keyword querying on fuzzy XML documents. ...
As the fuzzy data management has become one of the main research topics and directions, the question of how to obtain the useful information by means of keyword query from fuzzy XML documents is becoming ...
Index Construction In order to realize the object-oriented keyword queries on the fuzzy XML document, we build five indexes to serve the algorithm proposed below: (2) The list of minimum object trees: ...
doi:10.20532/cit.2016.1002861
fatcat:ioivknnitne3ld7rq3pdjzowl4
Improving the Efficiency of XPath Execution on Relational Systems
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The method is based on the splitting of XPath expressions into Primary Path Fragments (PPFs) and their subsequent combination using an efficient structural join method, and is applicable to all XPath axes ...
XML schema information and has low implementation complexity. ...
Root-to-node path index and other relational indices We store for each element node its root-to-node path and use it as an index. ...
doi:10.1007/11687238_35
fatcat:3h5b7szafnanbaxskfx4yxk3fy
A Survey of Algorithms for Keyword Search on Graph Data
[chapter]
2010
Managing and Mining Graph Data
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
For example, in XRank [13], the Dewey inverted list is used to index paths so that a keyword query can be evaluated without tree traversal. ...
Connectivity information can also be efficiently encoded and indexed. ...
The Dewey ID of a node is the concatenation of the numbers assigned to the nodes on the path from the root to . ...
doi:10.1007/978-1-4419-6045-0_8
dblp:series/ads/WangA10
fatcat:7qain3m47vca5haasx5xxgzqwi
From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern Matching
2005
Very Large Data Bases Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. ...
Unlike all previous algorithms based on region encoding, to answer a twig query, TJFast only needs to access the labels of the leaf query nodes. ...
Acknowledgment We would like to thank the anonymous reviewers of VLDB for their constructive and valuable comments. ...
dblp:conf/vldb/LuLCC05
fatcat:bt365el67jeuvewp5l5fk3dalq
Classification of Index Partitions to Boost XML Query Performance
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we provide a process for compacting the index and reducing the number of node access operations in order to optimize XML queries. ...
XML query optimization continues to occupy considerable research effort due to the increasing usage of XML data. ...
Index Deployment and Query Processing In this section, we describe the indexing constructs resulting from the indexing process in §3. ...
doi:10.1007/978-3-642-16373-9_29
fatcat:3w6qhdilqrffzbommhiif3d6uy
SEDA
2008
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Keyword search in XML repositories is a powerful tool for interactive data exploration. ...
SEDA also computes all the contexts in which the query terms are found and all the connection paths that connect the query terms in the XML data. ...
The bloom filter index encodes the shortest paths between node pairs, excluding paths that traverse only parent/child edges, as these paths can be computed using their Dewey ids [3] . ...
doi:10.14778/1454159.1454185
fatcat:fs7mrn6mavbydepvrcarmuuk64
Indexing and querying XML using extended Dewey labeling scheme
2011
Data & Knowledge Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The Dewey labeling scheme is commonly used to label an XML document to facilitate XML query processing by recording information on the path of an element. ...
types and identifiers of elements in a label, and to avoid the scan of labels for internal query nodes to accelerate query processing (in I/O cost). ...
We treat the detailed pattern mining and index construction algorithms as our future work. ...
doi:10.1016/j.datak.2010.08.001
fatcat:6gtgqelrrbgbfcn65tulsiqvci
Top-k keyword search over probabilistic XML data
2011
2011 IEEE 27th International Conference on Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. ...
Compared with traditional keyword search, it is far more expensive to answer a keyword query over probabilistic XML data due to the consideration of possible world semantics. ...
Encoding Probabilistic XML Data Dewey encoding scheme has been verified and applied as an effective and efficient way in previous keyword search approaches [12] , [14] . ...
doi:10.1109/icde.2011.5767875
dblp:conf/icde/LiLZW11
fatcat:yielg2b3pbcydbyi32b6nrdiri
Semantic-based Structural and Content indexing for the efficient retrieval of queries over large XML data repositories
2014
Future generations computer systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Schema Index, Data Index and Value Index; and (ii) query processing to produce the final results in optimal time. ...
Then, it evaluates branched queries through two essential components: (i) Structural and Content indexing, which use an object-based connection to construct indices i.e. ...
Acknowledgment The first author would like to express her gratitude to the Taif University in Saudi Arabia, for supporting her with a scholarship. ...
doi:10.1016/j.future.2014.02.010
fatcat:liwz6tqt4bfbbjrawrazwbb2zu
ELCA Evaluation for Keyword Search on Probabilistic XML Data
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
In this paper, we investigate how to evaluate ELCA results for keyword queries on probabilistic XML documents. ...
Then we develop an efficient stack-based algorithm that can find all probabilistic ELCA results and their ELCA probabilities for a given keyword query on a probabilistic XML document. ...
Indexing Probabilistic XML Data We use Dewey Encoding Scheme [18] to encode the probabilistic XML document. ...
arXiv:1110.2890v1
fatcat:ljlfekkrnjclroky7e6ctuurta
ELCA evaluation for keyword search on probabilistic XML data
2012
World wide web (Bussum)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we investigate how to evaluate ELCA results for keyword queries on probabilistic XML documents. ...
Then we develop an efficient stack-based algorithm that can find all probabilistic ELCA results and their ELCA probabilities for a given keyword query on a probabilistic XML document. ...
Indexing Probabilistic XML Data We use Dewey Encoding Scheme [18] to encode the probabilistic XML document. ...
doi:10.1007/s11280-012-0166-4
fatcat:ncbwzqdra5b6nhwopjichibxwq
XIOTR :A Terse Ranking of XIO for XML Keyword Search
2011
Journal of Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We design an XML keyword search approach, that can derive the keyword query and generate a set of effective structured queries by analyzing the given keyword query and the schemas of XML data sources. ...
Keyword search has attracted a great deal of attention for retrieving XML data because it is a userfriendly mechanism. ...
A path stack algorithm, is probably the most efficient method for twig queries using sequential scans of index lists and linked stacks in memory. ...
doi:10.4304/jsw.6.1.156-163
fatcat:owg44tgefzg4bpzlwswfx3pe2y
A survey on tree matching and XML retrieval
2013
Computer Science Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
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 ...
They usually use the tree representation of documents and queries to process them, whether in an implicit or explicit way. ...
This indexing approach transforms XML documents and twig query into sequences by prüfer method that constructs an one-to-one correspondence between trees and sequences. ...
doi:10.1016/j.cosrev.2013.02.001
fatcat:6xnbgq4txvgxtnw35myadfmtkm
« Previous
Showing results 1 — 15 out of 152 results