Filters








550 Hits in 8.3 sec

A coherent query language for XML

Krishnaprasad Thirunarayan, Trivikram Immaneni
2008 Journal of Intelligent Information Systems  
In this paper, we present a simple yet flexible query language, and develop its semantics to enable intuitively appealing extraction of relevant fragments of information while simultaneously falling back  ...  Text search engines are inadequate for indexing and searching XML documents because they ignore metadata and aggregation structure implicit in the XML documents.  ...  Acknowledgements: We thank the referees for their valuable feedback.  ... 
doi:10.1007/s10844-007-0051-2 fatcat:t5joiiho75gd5anr754vlvr3aq

Data Mining for XML Query-Answering Support

Mirjana Mazuran, Elisa Quintarelli, Letizia Tanca
2012 IEEE Transactions on Knowledge and Data Engineering  
Extracting information from semistructured documents is a very hard task, and is going to become more and more critical as the amount of digital information available on the Internet grows.  ...  A prototype system and experimental results demonstrate the effectiveness of the approach.  ...  The tool implements the CMTTreeMiner [7] algorithm for the extraction of frequent subtrees from the XML document.  ... 
doi:10.1109/tkde.2011.80 fatcat:d5x4chvwxrcrnboixvopr73n7q

XML clustering: a review of structural approaches

Maciej Piernik, Dariusz Brzezinski, Tadeusz Morzy, Anna Lesniewska
2014 Knowledge engineering review (Print)  
A common problem among the mentioned applications involves structural clustering of XML documents—an issue that has been thoroughly studied and led to the creation of a myriad of approaches.  ...  By providing an up-to-date analysis of existing structural XML clustering algorithms, we hope to showcase methods suitable for current applications and draw lines of future research.  ...  Acknowledgement The authors wish to thank the editor and the anonymous reviewers for their useful comments and suggestions.  ... 
doi:10.1017/s0269888914000216 fatcat:icmzquio7vee7eaqwtabejm7ne

Efficiently mining frequent trees in a forest

Mohammed J. Zaki
2002 Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '02  
We present TreeMiner, a novel algorithm to discover all frequent subtrees in a forest, using a new data structure called scope-list.  ...  We formulate the problem of mining (embedded) subtrees in a forest of rooted, labeled, and ordered trees.  ...  The input data is in the form of XML documents that represent user-session extracted from raw web logs.  ... 
doi:10.1145/775047.775058 dblp:conf/kdd/Zaki02 fatcat:3sptvfe72jb2zgmvrjpowo7hie

Efficiently mining frequent trees in a forest

Mohammed J. Zaki
2002 Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '02  
We present TreeMiner, a novel algorithm to discover all frequent subtrees in a forest, using a new data structure called scope-list.  ...  We formulate the problem of mining (embedded) subtrees in a forest of rooted, labeled, and ordered trees.  ...  The input data is in the form of XML documents that represent user-session extracted from raw web logs.  ... 
doi:10.1145/775056.775058 fatcat:nq37ceqepjdrha7bpwceuvs4ma

Indexing useful structural patterns for XML query processing

Wang Lian, N. Mamoulis, D.W. Cheung, S.M. Yiu
2005 IEEE Transactions on Knowledge and Data Engineering  
Existing path-based indexes and query processing algorithms are not efficient for searching complex structures beyond simple paths, even when the queries are high-selective.  ...  Index Terms-Query processing, XML/XSL/RDF, mining methods and algorithms, document indexing.  ...  ACKNOWLEDGMENTS This work has been partially supported by grants HKU 7380/02E and HKU 7149/03E from Hong Kong RGC.  ... 
doi:10.1109/tkde.2005.110 fatcat:mmyd7toxlve47irnqtikfapu6u

Collaborative Clustering of XML Documents

Sergio Greco, Francesco Gullo, Giovanni Ponti, Andrea Tagarelli
2009 2009 International Conference on Parallel Processing Workshops  
We evaluated effectiveness and efficiency of our approach on real XML document collections varying the number of peers.  ...  Clustering XML documents is extensively used to organize large collections of XML documents in groups that are coherent according to structure and/or content features.  ...  We evaluated effectiveness and efficiency of our approach on real XML document collections varying the number of peers.  ... 
doi:10.1109/icppw.2009.58 dblp:conf/icppw/GrecoGPT09 fatcat:gk56topsfzgdzelcua5vodhbdy

Collaborative clustering of XML documents

Sergio Greco, Francesco Gullo, Giovanni Ponti, Andrea Tagarelli
2011 Journal of computer and system sciences (Print)  
We evaluated effectiveness and efficiency of our approach on real XML document collections varying the number of peers.  ...  Clustering XML documents is extensively used to organize large collections of XML documents in groups that are coherent according to structure and/or content features.  ...  We evaluated effectiveness and efficiency of our approach on real XML document collections varying the number of peers.  ... 
doi:10.1016/j.jcss.2011.02.005 fatcat:pppkc7yrrnalbhemdg27flztsm

A Survey on XML Fragmentation

Vanessa Braganholo, Marta Mattoso
2014 SIGMOD record  
Efficient document processing is a must when large volumes of XML data are involved.  ...  This paper surveys the existing XML fragmentation approaches in literature, comparing their features and highlighting their drawbacks. Our contribution resides in establishing a map of the area.  ...  We would like to thank Luiz Augusto Matos da Silva for helping in the bibliographic search. We would also like to thank CNPq and FAPERJ for partially supporting this research.  ... 
doi:10.1145/2694428.2694434 fatcat:4clsnyhunracvop2f5nco7ms64

TRIPS and TIDES

Shirish Tatikonda, Srinivasan Parthasarathy, Tahsin Kurc
2006 Proceedings of the 15th ACM international conference on Information and knowledge management - CIKM '06  
We propose novel algorithms to mine frequent subtrees from a database of rooted trees.  ...  In this paper, we address the problem of frequent subtree mining that has proven to be viable in a wide range of applications such as bioinformatics, XML processing, computational linguistics, and web  ...  We would like to thank authors of TreeMiner and XSpanner for providing us the source code or binary.  ... 
doi:10.1145/1183614.1183680 dblp:conf/cikm/TatikondaPK06 fatcat:yau23mo27fcxnicoxznjsqy5gi

Toward Semantic XML Clustering [chapter]

Andrea Tagarelli, Sergio Greco
2006 Proceedings of the 2006 SIAM International Conference on Data Mining  
Discovering knowledge to infer semantic organization of XML documents has become a major challenge in XML data management.  ...  We propose a framework for clustering semantically cohesive XML structures based on a transactional representation model.  ...  XML features are conveyed by XML tree tuple items. 2. We conceive a transactional model for representing the XML tree tuples extracted from a collection of XML documents.  ... 
doi:10.1137/1.9781611972764.17 dblp:conf/sdm/TagarelliG06 fatcat:c5o2ql5rnncrhnfqaoyhnssome

Distributed XML Query Processing [chapter]

M. Tamer Özsu, Patrick Kling
2010 Lecture Notes in Computer Science  
Distributing data collections by fragmenting them is an effective way of improving the scalability of a database system.  ...  We demonstrate that our techniques can be integrated into a real-life XML database system and that they significantly improve the performance of distributed query execution.  ...  Subtrees can be inserted or removed from a document collection without having to modify other parts of the collection and without having to maintain a centralized index.  ... 
doi:10.1007/978-3-642-15684-7_1 fatcat:hisdfxw5wjevhcp2btwvbrdqhe

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  ...  To circumvent this problem, we propose a set of new locking-aware operators for twig pattern query evaluation that rely on stable path labeling IDs (SPLIDs) as well as document and element set indexes.  ...  of the queries, we generated a collection of synthetic XML documents, whose structure is partly depicted in Figure 12 .  ... 
doi:10.1145/1142473.1142526 dblp:conf/sigmod/MathisHH06 fatcat:y5nbemmwuzafxo66rzzv77ym3u

Exploiting and Maintaining Materialized Views for XML Keyword Queries

Ziyang Liu, Yi Chen
2012 ACM Transactions on Internet Technology  
Experimental evaluation demonstrates the significance and efficiency of our approach.  ...  Keyword query is a user-friendly mechanism for retrieving useful information from XML data in Web and scientific applications.  ...  Some simple yet effective ways of selecting views include using recent queries, most frequent queries, frequent small queries, etc.  ... 
doi:10.1145/2390209.2390212 fatcat:k5cc2zdebncithqrirg4z5qpfi

Automatic extraction of drug-drug interaction from literature through detecting clause dependency and linguistic-based negation

Behrouz Bokharaeian, Alberto Diaz
2015 2015 Signal Processing and Intelligent Systems Conference (SPIS)  
The proposed method can be used as an alternative approach for sentence simplification techniques in biomedical area which is an error-prone task.  ...  Extracting biomedical relations such as drug-drug interaction (DDI) from text is an important task in biomedical natural language processing.  ...  the subtree kernel for sentences with negation cues and clause connectors demonstrated, the authors believe that more advanced kernels deriving more informative features from different presentations of  ... 
doi:10.1109/spis.2015.7422306 fatcat:aifv42eapfe4tlxf4yfq525iii
« Previous Showing results 1 — 15 out of 550 results