{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T11:42:40Z","timestamp":1767181360583,"version":"build-2238731810"},"reference-count":0,"publisher":"Inderscience Publishers","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJWMC"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1504\/ijwmc.2017.088083","type":"journal-article","created":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T07:30:08Z","timestamp":1511335808000},"page":"139","source":"Crossref","is-referenced-by-count":3,"title":["A fast search strategy to optimise path founding in big data graph computing environments"],"prefix":"10.1504","volume":"13","author":[{"given":"Wentian","family":"Qu","sequence":"first","affiliation":[]},{"given":"Dawei","family":"Sun","sequence":"additional","affiliation":[]}],"member":"378","container-title":["International Journal of Wireless and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.inderscienceonline.com\/doi\/full\/10.1504\/IJWMC.2017.088083","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T07:30:11Z","timestamp":1511335811000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.inderscience.com\/link.php?id=88083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":0,"aliases":["10.1504\/ijwmc.2017.10009065"],"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1504\/ijwmc.2017.088083","relation":{},"ISSN":["1741-1084","1741-1092"],"issn-type":[{"value":"1741-1084","type":"print"},{"value":"1741-1092","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"article-number":"88083"}}