Filters








9 Hits in 2.2 sec

Load balancing parallelizing XML query processing based on shared cache chip multi-processor (CMP)
English

Zuo Wanli, Chen Yongheng, He Fengling, Chen Kerui
2011 Scientific Research and Essays  
Chip multi-processor (CMP) could support more than two threads to execute simultaneously, and some executing units are owned by each core.  ...  Firstly, a set of algorithms for constructing the parallel sub-query plans and partitioning XML document by parallel sub-query plans are proposed.  ...  In addition, Lu and Gannon (2007) proposed a parallel processing model for the XML document on a multi-core computer.  ... 
doi:10.5897/sre11.444 fatcat:peueh235djee7nycgjbyxeeqty

LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying

Shirish Tatikonda, Srinivasan Parthasarathy, Matthew Goyder
2007 Very Large Data Bases Conference  
Finally, we show that our approach is suitable for emerging multi-core server architectures when retrieving data for more expensive queries.  ...  Our approach relies on representing both the queries and the data using a sequential encoding and then subsequently employing an innovative variant of the longest common subsequence (LCS) matching algorithm  ...  Such an approach results in small memory footprints, good locality, and is amenable to parallelization on emerging multi-core architectures.  ... 
dblp:conf/vldb/TatikondaPG07 fatcat:q55lb7e45vdm3ijxkwk2gheyza

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  ...  This is an author-deposited version published in : http://oatao.univ-toulouse.fr/ Eprints ID : 12411 To link to this article : A B S T R A C T With the increasing number of available XML documents, numerous  ...  It would also be interesting to study the parallelism of holistic algorithms on a multi-core system in order to maximize the computing performance of query processing in a large XML database.  ... 
doi:10.1016/j.cosrev.2013.02.001 fatcat:6xnbgq4txvgxtnw35myadfmtkm

Performing grouping and aggregate functions in XML queries

Huayu Wu, Tok Wang Ling, Liang Xu, Zhifeng Bao
2009 Proceedings of the 18th international conference on World wide web - WWW '09  
Existing works in XML query processing mainly focus on physically matching query structure over XML document.  ...  In this paper, we extend our previous XML query processing algorithm, VERT, to efficiently perform grouping and aggregate function in queries.  ...  Experimental settings We implemented all algorithms in Java. The experiments were performed on a dual-core 2.33GHz processor with 4G RAM.  ... 
doi:10.1145/1526709.1526844 dblp:conf/www/WuLXB09 fatcat:yas3xap72nemjcjsrcibr7fsaq

Locking-aware structural join operators for XML query processing

Christian Mathis, Theo Härder, Michael Haustein
2006 Proceedings of the 2006 ACM SIGMOD international conference on Management of data - SIGMOD '06  
As observed in many publications so far, the matching of twig pattern queries is a core operation in XML database management systems (XDBMSs) for which the structural join and the holistic twig join algorithms  ...  In a single-user environment, especially the latter algorithm provides a good evaluation strategy.  ...  To compare the "best" structural join algorithms with our operators, we implemented TwigOptimal (TwigOpt) [8] and the original TwigStack algorithm (TwigOld) [4] in our XTC system.  ... 
doi:10.1145/1142473.1142526 dblp:conf/sigmod/MathisHH06 fatcat:y5nbemmwuzafxo66rzzv77ym3u

An XML Streaming Data Processing Method based on Forest Transducer

Zhixue He
2017 International Journal of Performability Engineering  
processed on the fly, a method of processing XPath query based on forest transducer is proposed.  ...  Finally, the experimental results show that our approach is effective and efficient on this problem, and outperforms about 30 percent of the state-of-the-art algorithms especially for large processed data  ...  For the methods that are based on stack, TwigM is a lazy streaming processing method, which extends the multi-stack framework of the TwigStack algorithm.  ... 
doi:10.23940/ijpe.17.05.p7.620632 fatcat:mrd3hiyim5erpbeukcvf6w5vna

Efficient indexing and querying over syntactically annotated trees

Pirooz Chubak, Davood Rafiei
2012 Proceedings of the VLDB Endowment  
One major drawback of current systems supporting querying over parsed text is the performance of evaluating queries over large data.  ...  Our extensive set of experiments show that rootsplit coding reduces the index size of any interval coding which stores individual node numbers by a factor of 50% to 80%, depending on the sizes of subtrees  ...  All our experiments were run on a 64-bit machine with 64 GB of physical memory and a 4x quad-core processor. The system page size was 4096 bytes.  ... 
doi:10.14778/2350229.2350249 fatcat:oeqxxnvtpff6nihqaboaijszha

Efficient Indexing and Querying over Syntactically Annotated Trees [article]

Pirooz Chubak, Davood Rafiei
2012 arXiv   pre-print
One major drawback of current systems supporting querying over parsed text is the performance of evaluating queries over large data.  ...  Our extensive set of experiments show that root-split coding reduces the index size of any interval coding which stores individual node numbers by a factor of 50% to 80%, depending on the sizes of subtrees  ...  All our experiments were run on a 64-bit machine with 64 GB of physical memory and a 4x quad-core processor. The system page size was 4096 bytes.  ... 
arXiv:1208.0092v1 fatcat:2hpxoq55yvgi5dgaw22pii7anu

Indexing and Querying Natural Language Text

Pirooz Chubak
2012
He has done a tremendous job as a mentor and supervisor, and put a great deal of time and energy into my research and other academic and life challenges.  ...  I greatfully acknowledge Dennis Shasha, Shane Bergsma, and Christopher Pinchak for providing me with their expert opinion on specific subjects related to my research.  ...  Finally ST and MT refer to a Single-layer or a Multi-layer Time-aligned parallel corpus.  ... 
doi:10.7939/r3gq6q fatcat:jbfsgoxgvbdetmdwi2imfjrp6i