{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T05:37:06Z","timestamp":1768455426776,"version":"3.49.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,8]]},"abstract":"<jats:p>\n            A large body of research on subgraph query processing on large networks assumes that a query is posed in the form of a connected graph. Unfortunately, end users in practice may not always have precise knowledge about the topological relationships between nodes in a query graph to formulate a connected query. In this demonstration, we present a novel graph querying paradigm called\n            <jats:italic>partial topology-based network search<\/jats:italic>\n            and a query processing system called\n            <jats:sc>panda<\/jats:sc>\n            to efficiently find\n            <jats:italic>top-k matches of a partial topology query<\/jats:italic>\n            (\n            <jats:sc>ptq<\/jats:sc>\n            ) in a single machine. A\n            <jats:sc>ptq<\/jats:sc>\n            is a disconnected query graph containing multiple connected\n            <jats:italic>query components<\/jats:italic>\n            .\n            <jats:sc>ptq<\/jats:sc>\n            s allow an end user to formulate queries without demanding precise information about the complete topology of a query graph. We demonstrate various innovative features of\n            <jats:sc>panda<\/jats:sc>\n            and its promising performance.\n          <\/jats:p>","DOI":"10.14778\/3229863.3236236","type":"journal-article","created":{"date-parts":[[2018,9,10]],"date-time":"2018-09-10T12:12:28Z","timestamp":1536581548000},"page":"1966-1969","source":"Crossref","is-referenced-by-count":3,"title":["PANDA"],"prefix":"10.14778","volume":"11","author":[{"given":"Miao","family":"Xie","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sourav S","family":"Bhowmick","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Su","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gao","family":"Cong","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wook-Shin","family":"Han","sequence":"additional","affiliation":[{"name":"POSTECH, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,8]]},"reference":[{"issue":"1","key":"e_1_2_1_1_1","volume":"154","author":"Duin C.","year":"2004","journal-title":"Steiner Problems. Euro. J. of Operational Res."},{"key":"e_1_2_1_2_1","volume-title":"NIPS","author":"Hamelin J.","year":"2005"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796255"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0447-0"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732293"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3229863.3236236","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:09:01Z","timestamp":1672222141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3229863.3236236"}},"subtitle":["a system for partial topology-based search on large networks"],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":6,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["10.14778\/3229863.3236236"],"URL":"https:\/\/doi.org\/10.14778\/3229863.3236236","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}