{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:12:35Z","timestamp":1740136355449,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,2,24]],"date-time":"2022-02-24T00:00:00Z","timestamp":1645660800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,2,24]],"date-time":"2022-02-24T00:00:00Z","timestamp":1645660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pers Ubiquit Comput"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s00779-022-01668-y","type":"journal-article","created":{"date-parts":[[2022,2,24]],"date-time":"2022-02-24T23:02:25Z","timestamp":1645743745000},"page":"1645-1652","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing knowledge accessibility in digital economy with search over enterprise data"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6937-3508","authenticated-orcid":false,"given":"Mehdi","family":"Kargar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,24]]},"reference":[{"key":"1668_CR1","doi-asserted-by":"crossref","unstructured":"Akiba T, Iwata Y, Yoshida Y (2013) Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD, p 349\u2013360","DOI":"10.1145\/2463676.2465315"},{"key":"1668_CR2","doi-asserted-by":"crossref","unstructured":"Bhalotia G, Nakhe C, Hulgeri A, Chakrabarti S, Sudarshan S (2002) Keyword searching and browsing in databases using BANKS. In: ICDE, pp 431\u2013440","DOI":"10.1109\/ICDE.2002.994756"},{"key":"1668_CR3","doi-asserted-by":"crossref","unstructured":"Byrka J, Grandoni F, Rothvob T, Sanita L (2010) An improved LP-based approximation for Steiner Tree. In: STOC, pp 583\u2013592","DOI":"10.1145\/1806689.1806769"},{"key":"1668_CR4","doi-asserted-by":"crossref","unstructured":"Chen L, Liu C, Yang X, Wang B, Li JR, Zhou J (2016) Efficient batch processing for multiple keyword queries on graph data. In: CIKM, pp 1261\u20131270","DOI":"10.1145\/2983323.2983806"},{"key":"1668_CR5","unstructured":"Devlin J, Chang M, Lee K, Toutanova K (2019) BERT: pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 conference of the north american chapter of the association for computational linguistics: human language technologies (NAACL), pp 4171\u20134186"},{"key":"1668_CR6","doi-asserted-by":"crossref","unstructured":"He H, Wang H, Yang J, Yu P (2007) BLINKS: ranked keyword searches on graphs. In: SIGMOD, pp 305\u2013316","DOI":"10.1145\/1247480.1247516"},{"issue":"10","key":"1668_CR7","first-page":"2797","volume":"27","author":"N Jayaram","year":"2015","unstructured":"Jayaram N, Khan A, Li C (2015) Querying knowledge graphs by example entity tuples. TKDE 27(10):2797\u20132811","journal-title":"TKDE"},{"key":"1668_CR8","doi-asserted-by":"crossref","unstructured":"Jiang M, Fu A, Wong R (2015) Exact top-k nearest keyword search in large networks. In: SIGMOD, pp 393\u2013404","DOI":"10.1145\/2723372.2749447"},{"key":"1668_CR9","unstructured":"Kacholia V, Pandit S, Chakrabarti S, Sudarshan S, Desai R, Karambelkar H (2005) Bidirectional expansion for keyword search on graph databases. In: VLDB, pp 505\u2013516"},{"key":"1668_CR10","doi-asserted-by":"crossref","unstructured":"Kargar M (2019) Exploring structured information systems: a keyword search approach. In: Proceedings of IEEE 4th international conference on communication and information systems (ICCIS), pp 164\u2013467","DOI":"10.1109\/ICCIS49662.2019.00036"},{"issue":"4","key":"1668_CR11","first-page":"681","volume":"10","author":"M Kargar","year":"2011","unstructured":"Kargar M, An A (2011) Keyword search in graphs: finding r-cliques. PVLDB 10(4):681\u2013692","journal-title":"PVLDB"},{"issue":"7","key":"1668_CR12","first-page":"1657","volume":"26","author":"M Kargar","year":"2014","unstructured":"Kargar M, An A, Yu X (2014) Efficient duplication free and minimal keyword search in graphs. TKDE 26(7):1657\u20131669","journal-title":"TKDE"},{"key":"1668_CR13","doi-asserted-by":"crossref","unstructured":"Kargar M, Golab L, Srivastava D, Szlichta J, Zihayat M (2020) Effective keyword search over weighted graphs. IEEE Transactions on Knowledge and Data Engineering (TKDE)","DOI":"10.1109\/ICDE51399.2021.00261"},{"key":"1668_CR14","doi-asserted-by":"crossref","unstructured":"Kargar M, Golab L, Szlichta J (2016) eGraphSearch: effective keyword search in graphs. In: CIKM, system demonstration, pp 2461\u20132464","DOI":"10.1145\/2983323.2983333"},{"key":"1668_CR15","doi-asserted-by":"crossref","unstructured":"Kasneci G, Elbassuoni S, Weikum G (2009) MING: mining informative entity relationship subgraphs. In: CIKM, pp 1653\u20131656","DOI":"10.1145\/1645953.1646196"},{"issue":"12","key":"1668_CR16","first-page":"2042","volume":"8","author":"A Khan","year":"2015","unstructured":"Khan A, Chen L (2015) On uncertain graphs modeling and queries. PVLDB 8(12):2042\u20132043","journal-title":"PVLDB"},{"issue":"7","key":"1668_CR17","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"EL Lawler","year":"1972","unstructured":"Lawler EL (1972) A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Manag Sci 18(7):401\u2013405","journal-title":"Manag Sci"},{"key":"1668_CR18","doi-asserted-by":"crossref","unstructured":"Li G, Ooi B, Feng J, Wang J, Zhou L (2008) EASE: efficient and adaptive keyword search on unstructured, semi-structured and structured data. In: SIGMOD, pp 903\u2013904","DOI":"10.1145\/1376616.1376706"},{"key":"1668_CR19","doi-asserted-by":"crossref","unstructured":"Li G, Ooi BC, Feng J, Wang J, Zhou L (2008) Ease: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, pp 903\u2013914. ACM","DOI":"10.1145\/1376616.1376706"},{"issue":"5","key":"1668_CR20","first-page":"1041","volume":"27","author":"X Lian","year":"2015","unstructured":"Lian X, Chen L, Huang Z (2015) Keyword search over probabilistic RDF graphs. TKDE 27(5):1041\u20134347","journal-title":"TKDE"},{"issue":"8","key":"1668_CR21","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1109\/TKDE.2017.2690637","volume":"29","author":"Z Liu","year":"2017","unstructured":"Liu Z, Wang C, Chen Y (2017) Keyword search on temporal graphs. IEEE Transactions on Knowledge and Data Engineering (TKDE) 29(8):1667\u20131680","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"1668_CR22","doi-asserted-by":"crossref","unstructured":"Orhean A, Ijagbone I, Raicu I, Chard K, Zhao D (2017) Toward scalable indexing and search on distributed and unstructured data. In: IEEE BigData Congress","DOI":"10.1109\/BigDataCongress.2017.14"},{"issue":"10","key":"1668_CR23","first-page":"901","volume":"6","author":"M Qiao","year":"2013","unstructured":"Qiao M, Qin L, Cheng H, Yu J, Tian W (2013) Top-K nearest keyword search on large graphs. PVLDB 6(10):901\u2013912","journal-title":"PVLDB"},{"key":"1668_CR24","doi-asserted-by":"crossref","unstructured":"Qin L, Yu J, Chang L, Tao Y (2009) Querying communities in relational databases. In: ICDE, pp 724\u2013735","DOI":"10.1109\/ICDE.2009.67"},{"issue":"1","key":"1668_CR25","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/S0895480101393155","volume":"19","author":"G Robins","year":"2005","unstructured":"Robins G, Zelikovsky A (2005) Tighter bounds for graph Steiner tree approximation. SIAM J Discrete Math 19(1):122\u2013134","journal-title":"SIAM J Discrete Math"},{"key":"1668_CR26","doi-asserted-by":"crossref","unstructured":"Rousseau F, Vazirgiannis M (2013) Graph-of-word and TW-IDF: new approach to ad hoc IR. In: CIKM, pp 59\u201368","DOI":"10.1145\/2505515.2505671"},{"key":"1668_CR27","doi-asserted-by":"crossref","unstructured":"Spitz A, Gertz M (2016) Terms over LOAD: leveraging named entities for cross-document extraction and summarization of events. In: SIGIR, pp 503\u2013512","DOI":"10.1145\/2911451.2911529"},{"key":"1668_CR28","doi-asserted-by":"crossref","unstructured":"Stanovsky G, Michael J, Zettlemoyer L, Dagan I (2018) Supervised open information extraction. In: NAACL-HLT, pp 885\u2013895","DOI":"10.18653\/v1\/N18-1081"},{"issue":"12","key":"1668_CR29","doi-asserted-by":"publisher","first-page":"2724","DOI":"10.1109\/TKDE.2017.2754499","volume":"29","author":"Q Wang","year":"2017","unstructured":"Wang Q, Mao Z, Wang B, Guo L (2017) Knowledge graph embedding: a survey of approaches and applications. IEEE Transactions on Knowledge and Data Engineering (TKDE) 29(12):2724\u20132743","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"1668_CR30","doi-asserted-by":"crossref","unstructured":"Wang Y, Wang K, Fu AW, Wong RC (2015) KeyLabel algorithms for keyword search in large graphs. In: IEEE Big Data, pp 857\u2013864","DOI":"10.1109\/BigData.2015.7363833"},{"issue":"2","key":"1668_CR31","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00778-016-0447-0","volume":"26","author":"M Xie","year":"2017","unstructured":"Xie M, Bhowmick S, Cong G, Wang Q (2017) PANDA: toward partial topology-based search on large networks in a single machine. VLDBJ 26(2):203\u2013228","journal-title":"VLDBJ"},{"issue":"11","key":"1668_CR32","first-page":"899","volume":"4","author":"X Yang","year":"2011","unstructured":"Yang X, Procopiuc CM, Srivastava D (2011) Summary graphs for relational database schemas. PVLDDB 4(11):899\u2013910","journal-title":"PVLDDB"},{"issue":"12","key":"1668_CR33","first-page":"2767","volume":"25","author":"Y Yuan","year":"2013","unstructured":"Yuan Y, Wang G, Chen L, Wang H (2013) Efficient keyword search on uncertain graph data. TKDE 25(12):2767\u20132779","journal-title":"TKDE"},{"key":"1668_CR34","doi-asserted-by":"crossref","unstructured":"Zhou B (2011) Keyword search on large-scale structured, semi-structured, unstructured data. In: Handbook of Data Intensive Computing","DOI":"10.1007\/978-1-4614-1415-5_29"},{"issue":"4","key":"1668_CR35","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00778-017-0464-7","volume":"26","author":"Q Zhu","year":"2017","unstructured":"Zhu Q, Cheng H, Huang X (2017) I\/O-efficient algorithms for top-k nearest keyword search in massive graphs. VLDBJ 26(4):563\u2013583","journal-title":"VLDBJ"}],"container-title":["Personal and Ubiquitous Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00779-022-01668-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00779-022-01668-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00779-022-01668-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T09:26:21Z","timestamp":1693301181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00779-022-01668-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,24]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1668"],"URL":"https:\/\/doi.org\/10.1007\/s00779-022-01668-y","relation":{},"ISSN":["1617-4909","1617-4917"],"issn-type":[{"type":"print","value":"1617-4909"},{"type":"electronic","value":"1617-4917"}],"subject":[],"published":{"date-parts":[[2022,2,24]]},"assertion":[{"value":"31 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}