{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:49:18Z","timestamp":1743054558802,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811532801"},{"type":"electronic","value":"9789811532818"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3281-8_10","type":"book-chapter","created":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:02:51Z","timestamp":1580900571000},"page":"98-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Leveraging Pattern Mining Techniques for Efficient Keyword Search on Data Graphs"],"prefix":"10.1007","author":[{"given":"Xinge","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitri","family":"Theodoratos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aggeliki","family":"Dimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,6]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer: a system for keyword-based search over relational databases. In: IEEE ICDE, pp. 5\u201316 (2002)","DOI":"10.1145\/564691.564782"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bao, Z., Zeng, Y., Jagadish, H.V., Ling, T.W.: Exploratory keyword search with interactive input. In: ACM SIGMOD, pp. 871\u2013876 (2015)","DOI":"10.1145\/2723372.2735361"},{"key":"10_CR3","unstructured":"Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using banks. In: ICDE, pp. 431\u2013440 (2002)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-24775-3_9","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y Chi","year":"2004","unstructured":"Chi, Y., Yang, Y., Xia, Y., Muntz, R.R.: CMTreeMiner: Mining both closed and maximal frequent subtrees. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 63\u201373. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24775-3_9"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.is.2014.07.002","volume":"47","author":"A Dimitriou","year":"2015","unstructured":"Dimitriou, A., Theodoratos, D., Sellis, T.K.: Top-k-size keyword search on tree structured data. Inf. Syst. 47, 178\u2013193 (2015)","journal-title":"Inf. Syst."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Elbassuoni, S., Blanco, R.: Keyword search over RDF graphs. In: ACM CIKM, pp. 237\u2013242 (2011)","DOI":"10.1145\/2063576.2063615"},{"issue":"12","key":"10_CR7","first-page":"1781","volume":"23","author":"J Feng","year":"2011","unstructured":"Feng, J., Li, G., Wang, J.: Finding top-k answers in keyword search over relational databases using tuple units. IEEE ICDE 23(12), 1781\u20131794 (2011)","journal-title":"IEEE ICDE"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Golenberg, K., Kimelfeld, B., Sagiv, Y.: Keyword proximity search in complex data graphs. In: Proceedings of the ACM SIGMOD, pp. 927\u2013940 (2008)","DOI":"10.1145\/1376616.1376708"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"He, H., Wang, H., Yang, J., Yu, P.S.: BLINKS: ranked keyword searches on graphs. In: ACM SIGMOD, pp. 305\u2013316 (2007)","DOI":"10.1145\/1247480.1247516"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Gravano, L., Papakonstantinou, Y.: Efficient ir-style keyword search over relational databases. In: VLDB, pp. 850\u2013861 (2003)","DOI":"10.1016\/B978-012722442-8\/50080-X"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Papakonstantinou, Y.: DISCOVER: keyword search in relational databases. In: VLDB, pp. 670\u2013681 (2002)","DOI":"10.1016\/B978-155860869-6\/50065-2"},{"key":"10_CR12","unstructured":"Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In: VLDB, pp. 505\u2013516 (2005)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Kargar, M., An, A., Cercone, N., Godfrey, P., Szlichta, J., Yu, X.: Meaningful keyword search in relational databases with large and complex schema. In: IEEE ICDE, pp. 411\u2013422 (2015)","DOI":"10.1109\/ICDE.2015.7113302"},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/3022860.3022863","volume":"45","author":"TN Le","year":"2016","unstructured":"Le, T.N., Ling, T.W.: Survey on keyword search over XML documents. SIGMOD Rec. 45(3), 17\u201328 (2016)","journal-title":"SIGMOD Rec."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Liu, F. Yu, C., Meng, W., Chowdhury, A.: Effective keyword search in relational databases. In: ACM SIGMOD, pp. 563\u2013574 (2006)","DOI":"10.1145\/1142473.1142536"},{"issue":"5\u20136","key":"10_CR16","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s11280-011-0128-2","volume":"14","author":"Z Liu","year":"2011","unstructured":"Liu, Z., Chen, Y.: Processing keyword search on XML: a survey. World Wide Web 14(5\u20136), 671\u2013707 (2011)","journal-title":"World Wide Web"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Markowetz, A., Yang, Y., Papadias, D.: Keyword search on relational data streams. In: ACM SIGMOD, pp. 605\u2013616 (2007)","DOI":"10.1145\/1247480.1247548"},{"key":"10_CR18","unstructured":"Nijssen, S., Kok, J.N.: Efficient discovery of frequent unordered trees. In: MGTS, pp. 55\u201364 (2003)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest. In: ACM SIGKDD, pp. 71\u201380 (2002)","DOI":"10.1145\/775047.775058"},{"issue":"1\u20132","key":"10_CR20","first-page":"33","volume":"66","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundam. Inform. 66(1\u20132), 33\u201352 (2005)","journal-title":"Fundam. Inform."}],"container-title":["Communications in Computer and Information Science","Web Information Systems Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3281-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T06:17:53Z","timestamp":1585721873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3281-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811532801","9789811532818"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3281-8_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wise2019.comp.polyu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"211","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"WISE 2019 has been postponed until January 2020 because of the problems in Hong Kong. For CCIS volume, Submissions: 30. Full papers accepted: 10. Short papers accepted: 5.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}