Finding smallest k-Compact tree set for keyword queries on graphs using mapreduce

Liu, Chengfei, Yao, Liang, Li, Jianxin, Zhou, Rui and He, Zhenying 2016, Finding smallest k-Compact tree set for keyword queries on graphs using mapreduce, World wide web, vol. 19, no. 3, pp. 499-518, doi: 10.1007/s11280-015-0337-1.

Attached Files
Name Description MIMEType Size Downloads

Title Finding smallest k-Compact tree set for keyword queries on graphs using mapreduce
Author(s) Liu, Chengfei
Yao, Liang
Li, JianxinORCID iD for Li, Jianxin orcid.org/0000-0002-9059-330X
Zhou, Rui
He, Zhenying
Journal name World wide web
Volume number 19
Issue number 3
Start page 499
End page 518
Total pages 20
Publisher Springer
Place of publication New York, N.Y.
Publication date 2016
ISSN 1386-145X
Keyword(s) Graph databases
MapReduce
Science & Technology
Technology
Computer Science, Information Systems
Computer Science, Software Engineering
Computer Science
Language eng
DOI 10.1007/s11280-015-0337-1
Field of Research 0805 Distributed Computing
0806 Information Systems
HERDC Research category C1.1 Refereed article in a scholarly journal
Copyright notice ©2015, Springer Science+Business Media New York
Persistent URL http://hdl.handle.net/10536/DRO/DU:30116202

Document type: Journal Article
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 3 times in TR Web of Science
Scopus Citation Count Cited 4 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 9 Abstract Views, 2 File Downloads  -  Detailed Statistics
Created: Thu, 20 Dec 2018, 17:32:52 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.