{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:25:45Z","timestamp":1770744345164,"version":"3.49.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T00:00:00Z","timestamp":1562716800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T00:00:00Z","timestamp":1562716800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s00778-019-00550-3","type":"journal-article","created":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T02:02:27Z","timestamp":1562724147000},"page":"649-673","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Evaluating pattern matching queries for spatial databases"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5047-8593","authenticated-orcid":false,"given":"Yixiang","family":"Fang","sequence":"first","affiliation":[]},{"given":"Yun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Reynold","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Nikos","family":"Mamoulis","sequence":"additional","affiliation":[]},{"given":"Gao","family":"Cong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"550_CR1","doi-asserted-by":"crossref","unstructured":"Zhang, D., et al.: Keyword search in spatial databases: towards searching by document. In: ICDE, pp. 688\u2013699. IEEE (2009)","DOI":"10.1109\/ICDE.2009.77"},{"key":"550_CR2","doi-asserted-by":"crossref","unstructured":"Guo, T., Cao, X., Cong, G.: Efficient algorithms for answering the m-closest keywords query. In: SIGMOD, pp. 405\u2013418. ACM (2015)","DOI":"10.1145\/2723372.2723723"},{"issue":"1","key":"550_CR3","first-page":"61","volume":"27","author":"K Deng","year":"2015","unstructured":"Deng, K., Li, X., Lu, J., Zhou, X.: Best keyword cover search. TKDE 27(1), 61\u201373 (2015)","journal-title":"TKDE"},{"key":"550_CR4","doi-asserted-by":"crossref","unstructured":"Choi, D., Pei, J., Lin, X.: Finding the minimum spatial keyword cover. In: ICDE, pp. 685\u2013696. IEEE (2016)","DOI":"10.1109\/ICDE.2016.7498281"},{"issue":"1","key":"550_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1008817325994","volume":"8","author":"J Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, J.: Ecology and urban planning. Biodivers. Conserv. 8(1), 119\u2013131 (1999)","journal-title":"Biodivers. Conserv."},{"issue":"1","key":"550_CR6","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s00267-002-2450-z","volume":"30","author":"J Schnaiberg","year":"2002","unstructured":"Schnaiberg, J., Riera, J., Turner, M.G., Voss, P.R.: Explaining human settlement patterns in a recreational lake district: Vilas county, Wisconsin, USA. Environ. Manag. 30(1), 24\u201334 (2002)","journal-title":"Environ. Manag."},{"key":"550_CR7","unstructured":"Settlement patterns (2017). \n                    http:\/\/geography.parkfieldprimary.com\/the-united-kingdom\/settlement-patterns"},{"key":"550_CR8","unstructured":"Ministry of Education of Singapore (2017). \n                    https:\/\/www.moe.gov.sg\/admissions\/primary-one-registration\/allocation"},{"key":"550_CR9","unstructured":"Papadias, D., et al.: Algorithms for querying by spatial structure. In: VLDB, pp. 546\u2013557 (1998)"},{"issue":"4","key":"550_CR10","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1145\/503099.503101","volume":"26","author":"N Mamoulis","year":"2001","unstructured":"Mamoulis, N., Papadias, D.: Multiway spatial joins. TODS 26(4), 424\u2013475 (2001)","journal-title":"TODS"},{"issue":"1","key":"550_CR11","first-page":"886","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou, L., Chen, L., \u00d6zsu, M.T.: Distance-join: pattern match query in a large graph database. PVLDB 2(1), 886\u2013897 (2009)","journal-title":"PVLDB"},{"key":"550_CR12","doi-asserted-by":"crossref","unstructured":"Carletti, V., et al.: Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3. In: TPAMI (2017)","DOI":"10.1109\/TPAMI.2017.2696940"},{"key":"550_CR13","unstructured":"Wu, Y., Patel, J.M., Jagadish, H.: Structural join order selection for XML query optimization. In: ICDE, pp. 443\u2013454. IEEE (2003)"},{"key":"550_CR14","doi-asserted-by":"crossref","unstructured":"Fang, Y., Cheng, R., Wang, J., Budiman, Cong, G., Mamoulis, N.: SpaceKey: exploring patterns in spatial databases. In: ICDE, pp. 1577\u20131580. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00180"},{"key":"550_CR15","doi-asserted-by":"crossref","unstructured":"Fang, Y., Cheng, R., Cong, G., Mamoulis, N., Li, Y.: On spatial pattern matching. In: ICDE, pp. 293\u2013304. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00035"},{"issue":"1","key":"550_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/3355491.3355493","volume":"11","author":"Yun Li","year":"2019","unstructured":"Li, Y., Fang, Y., Cheng, R., Zhang, W.: Spatial pattern matching: a new direction for finding spatial objects. SIGSPATIAL Spec 11(1), 3\u201312 (2019)","journal-title":"SIGSPATIAL Special"},{"key":"550_CR17","doi-asserted-by":"crossref","unstructured":"Fang, Y., Li, Y., Cheng, R., Mamoulis, N., Cong, G.: On spatial pattern matching. \n                    http:\/\/www.cse.unsw.edu.au\/~z3525370\/spm2019.pdf","DOI":"10.1109\/ICDE.2018.00035"},{"key":"550_CR18","doi-asserted-by":"crossref","unstructured":"Chen, L., Cong, G., Jensen, C.S., Wu, D.: Spatial keyword query processing: an experimental evaluation. In: PVLDB, pp. 217\u2013228 (2013)","DOI":"10.14778\/2535569.2448955"},{"issue":"10","key":"550_CR19","doi-asserted-by":"publisher","first-page":"1889","DOI":"10.1109\/TKDE.2011.172","volume":"24","author":"Dingming Wu","year":"2012","unstructured":"Wu, D., Yiu, M.L., Cong, G., Jensen, C.S.: Joint top-k spatial keyword query processing. TKDE 24(10), 1889\u20131903 (2012)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"550_CR20","doi-asserted-by":"crossref","unstructured":"Papadias, D., Mamoulis, N., Theodoridis, Y.: Processing and optimization of multiway spatial joins using r-trees. In: PODS (1999)","DOI":"10.1145\/303976.303981"},{"key":"550_CR21","unstructured":"Jin, J., An, N., Sivasubramaniam, A.: Analyzing range queries on spatial data. In: ICDE, pp. 525\u2013534 (2000)"},{"key":"550_CR22","first-page":"27","volume-title":"Lecture Notes in Computer Science","author":"Fei Chen","year":"2014","unstructured":"Chen, F., Wu, X.: Perfect pipelining for streaming large file in peer-to-peer networks. In: Theoretical Computer Science, pp. 27\u201338 (2014)"},{"key":"550_CR23","unstructured":"https:\/\/en.wikipedia.org\/wiki\/Geometric_distribution"},{"key":"550_CR24","unstructured":"https:\/\/en.wikipedia.org\/wiki\/Floyd-Warshall_algorithm"},{"key":"550_CR25","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks (2003). arXiv preprint \n                    arXiv:cs\/0310049"},{"issue":"1\u20132","key":"550_CR26","first-page":"1185","volume":"3","author":"S Zhang","year":"2010","unstructured":"Zhang, S., Yang, J., Jin, W.: Sapper: subgraph indexing and approximate matching in large graphs. PVLDB 3(1\u20132), 1185\u20131194 (2010)","journal-title":"PVLDB"},{"key":"550_CR27","doi-asserted-by":"crossref","unstructured":"Zhu, G., et al.: Treespan: efficiently computing similarity all-matching. In: SIGMOD, pp. 529\u2013540. ACM (2012)","DOI":"10.1145\/2213836.2213896"},{"issue":"3","key":"550_CR28","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1839490.1839491","volume":"4","author":"LT Thomas","year":"2010","unstructured":"Thomas, L.T., Valluri, S.R., Karlapalem, K.: Margin: maximal frequent subgraph mining. TKDD 4(3), 10 (2010)","journal-title":"TKDD"},{"issue":"3","key":"550_CR29","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc Netw 5(3), 269\u2013287 (1983)","journal-title":"Soc Netw"},{"issue":"6","key":"550_CR30","first-page":"709","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Li, X., Luo, S., Hu, J.: Effective community search over large spatial graphs. PVLDB 10(6), 709\u2013720 (2017)","journal-title":"PVLDB"},{"issue":"3","key":"550_CR31","first-page":"785","volume":"28","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Tang, W., Maniu, S., Yang, X.: Scalable algorithms for nearest-neighbor joins on big trajectory data. TKDE 28(3), 785\u2013800 (2016)","journal-title":"TKDE"},{"issue":"4","key":"550_CR32","first-page":"783","volume":"31","author":"Y Fang","year":"2019","unstructured":"Fang, Y., Wang, Z., Cheng, R., Li, X., Luo, S., Hu, J., Chen, X.: On spatial-aware community search. TKDE 31(4), 783\u2013798 (2019)","journal-title":"On spatial-aware community search. TKDE"},{"issue":"1","key":"550_CR33","first-page":"337","volume":"2","author":"G Cong","year":"2009","unstructured":"Cong, G., Jensen, C.S., Wu, D.: Efficient retrieval of the top-k most relevant spatial web objects. VLDB 2(1), 337\u2013348 (2009)","journal-title":"VLDB"},{"issue":"7","key":"550_CR34","first-page":"1706","volume":"28","author":"C Zhang","year":"2016","unstructured":"Zhang, C., Zhang, Y., Zhang, W., Lin, X.: Inverted linear quadtree: efficient top-k spatial keyword search. TKDE 28(7), 1706\u20131721 (2016)","journal-title":"TKDE"},{"key":"550_CR35","doi-asserted-by":"crossref","unstructured":"Huang, W., Li, G., Tan, K.-L., Feng, J.: Efficient safe-region construction for moving top-k spatial keyword queries. In: CIKM, pp. 932\u2013941. ACM (2012)","DOI":"10.1145\/2396761.2396879"},{"key":"550_CR36","unstructured":"Zhang, C., Zhang, Y., Zhang, W., Lin, X., Cheema, M.A., Wang, X.: Diversified spatial keyword search on road networks. In: EDBT, pp. 367\u2013378 (2014)"},{"key":"550_CR37","doi-asserted-by":"crossref","unstructured":"Mahmood, A.R., Aref, W.G., Aly, A.M., Tang, M.: Atlas: on the expression of spatial-keyword group queries using extended relational constructs. In: SIGSPATIAL, p. 45. ACM (2016)","DOI":"10.1145\/2996913.2996987"},{"key":"550_CR38","doi-asserted-by":"crossref","unstructured":"Cao, X., Cong, G., Jensen, C.S., Ooi, B.C.: Collective spatial keyword querying. In: SIGMOD, pp. 373\u2013384. ACM (2011)","DOI":"10.1145\/1989323.1989363"},{"issue":"5","key":"550_CR39","first-page":"529","volume":"10","author":"J Liu","year":"2017","unstructured":"Liu, J., Deng, K., Sun, H., Ge, Y., Zhou, X., Jensen, C.S.: Clue-based spatio-textual query. PVLDB 10(5), 529\u2013540 (2017)","journal-title":"PVLDB"},{"key":"550_CR40","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T., Kriegel, H.-P., Seeger, B.: Efficient processing of spatial joins using r-trees. In: SIGMOD, pp 237\u2013246 (1993)","DOI":"10.1145\/170036.170075"},{"issue":"2","key":"550_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/304181.304183","volume":"28","author":"N Mamoulis","year":"1999","unstructured":"Mamoulis, N., Papadias, D.: Integration of spatial join algorithms for processing multiple inputs. SIGMOD 28(2), 1\u201312 (1999)","journal-title":"SIGMOD"},{"key":"550_CR42","first-page":"45","volume":"6","author":"B Gallagher","year":"2006","unstructured":"Gallagher, B.: Matching structure and semantics: a survey on graph-based pattern matching. AAAI FS 6, 45\u201353 (2006)","journal-title":"AAAI FS"},{"key":"550_CR43","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Gallagher, B., Eliassi-Rad, T.: Fast best-effort pattern matching in large attributed graphs. In: KDD, pp. 737\u2013746 (2007)","DOI":"10.1145\/1281192.1281271"},{"issue":"2","key":"550_CR44","first-page":"510","volume":"28","author":"M Tang","year":"2016","unstructured":"Tang, M., et al.: Similarity group-by operators for multi-dimensional relational data. TKDE 28(2), 510\u2013523 (2016)","journal-title":"TKDE"},{"issue":"02","key":"550_CR45","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1142\/S021972001000477X","volume":"8","author":"M Mongiovi","year":"2010","unstructured":"Mongiovi, M., et al.: Sigma: a set-cover-based inexact graph matching algorithm. J. Bioinform. Comput. Biol. 8(02), 199\u2013218 (2010)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"550_CR46","doi-asserted-by":"crossref","unstructured":"Tian, Y., et al.: Tale: a tool for approximate large graph matching. In: ICDE, pp. 963\u2013972. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497505"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00550-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-019-00550-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00550-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T23:17:40Z","timestamp":1594250260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-019-00550-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,10]]},"references-count":46,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["550"],"URL":"https:\/\/doi.org\/10.1007\/s00778-019-00550-3","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,10]]},"assertion":[{"value":"10 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}