{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:57:34Z","timestamp":1725562654861},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145889"},{"type":"electronic","value":"9783642145896"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14589-6_2","type":"book-chapter","created":{"date-parts":[[2010,8,16]],"date-time":"2010-08-16T14:38:13Z","timestamp":1281969493000},"page":"2-19","source":"Crossref","is-referenced-by-count":0,"title":["On-Line Preferential Nearest Neighbor Browsing in Large Attributed Graphs"],"prefix":"10.1007","author":[{"given":"Jiefeng","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Reynold C. K.","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: Proc. of SIGMOD 1989 (1989)","DOI":"10.1145\/67544.66950"},{"key":"2_CR2","unstructured":"Chen, L., Gupta, A., Kurul, M.E.: Stack-based algorithms for pattern matching on dags. In: Proc. of VLDB 2005 (2005)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, J., Yu, J.X.: On-line exact shortest distance query processing. In: EDBT (2009)","DOI":"10.1145\/1516360.1516417"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, J., Yu, J.X., Ding, B., Yu, P.S., Wang, H.: Fast graph pattern matching. In: Proc. of ICDE 2008 (2008)","DOI":"10.1109\/ICDE.2008.4497500"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, J., Yu, J.X., Lin, X., Wang, H., Yu, P.S.: Fast computing reachability labelings for large graphs with high compression rate. In: Proc. of EDBT 2008 (2008)","DOI":"10.1145\/1353343.1353370"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: Proc. of SODA 2002 (2002)","DOI":"10.1137\/S0097539702403098"},{"key":"2_CR7","unstructured":"Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Predicting internet network distance with coordinates-based approaches. In: SIGCOMM (2004)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Math.\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Math."},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C. Gavoille","year":"2004","unstructured":"Gavoille, C., Peleg, D., P\u00e9rennes, S., Raz, R.: Distance labeling in graphs. J. Algorithms\u00a053(1), 85\u2013112 (2004)","journal-title":"J. Algorithms"},{"key":"2_CR10","unstructured":"Goldberg, A.V., Werneck, R.F.: Computing point-to-point shortest paths from external memory. In: ALENEX (2005)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Werneck, R.F.: Reach for a*: Efficient point-to-point shortest path algorithms. In: ALENEX (2006)","DOI":"10.1137\/1.9781611972863.13"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Gou, G., Chirkova, R.: Efficient algorithms for exact ranked twig-pattern matching over graphs. In: Proc. of SIGMOD 2008 (2008)","DOI":"10.1145\/1376616.1376676"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"He, H., Wang, H., Yang, J., Yu, P.S.: Blinks: ranked keyword searches on graphs. In: Proc. of SIGMOD 2007 (2007)","DOI":"10.1145\/1247480.1247516"},{"key":"2_CR14","unstructured":"Hu, H., Lee, D.L., Lee, V.C.S.: Distance indexing on road networks. In: VLDB (2006)"},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/99935.99944","volume":"15","author":"H.V. Jagadish","year":"1990","unstructured":"Jagadish, H.V.: A compression technique to materialize transitive closure. ACM Trans. Database Syst.\u00a015(4), 558\u2013598 (1990)","journal-title":"ACM Trans. Database Syst."},{"key":"2_CR16","unstructured":"Jiang, B.: I\/o-efficiency of shortest path algorithms: An analysis. In: ICDE (1992)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Wang, H.: Efficiently answering reachability queries on very large directed graphs. In: Proc. of SIGMOD 2008 (2008)","DOI":"10.1145\/1376616.1376677"},{"key":"2_CR18","unstructured":"Ng, T.S.E., Zhang, H.: Predicting internet network distance with coordiantes-based approaches. In: INFOCOM (2001)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<167::AID-JGT7>3.0.CO;2-5","volume":"33","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Proximity-preserving labeling schemes. J. Graph Theory\u00a033, 167\u2013176 (2000)","journal-title":"J. Graph Theory"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Rattigan, M.J., Maier, M., Jensen, D.: Using structure indices for efficient approximation of network properties. In: KDD (2006)","DOI":"10.1145\/1150402.1150443"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376623"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, J., Samet, H.: Distance oracles for spatial networks. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.53"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Schenkel, R., Theobald, A., Weikum, G.: Efficient creation and incremental maintenance of the HOPI index for complex XML document collections. In: Proc. of ICDE 2005 (2005)","DOI":"10.1109\/ICDE.2005.57"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. In: Proc. of STOC 2001 (2001)","DOI":"10.1145\/380752.380798"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Tri\u00dfI, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: Proc. of SIGMOD 2007 (2007)","DOI":"10.1145\/1247480.1247573"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Yuster, R., Zwick, U.: Answering distance queries in directed graphs using fast matrix multiplication. In: Proc. of FOCS 2005 (2005)","DOI":"10.1109\/SFCS.2005.20"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., \u00d6zsu, M.T.: Distancejoin: Pattern match query in a large graph database. In: VLDB (2009)","DOI":"10.14778\/1687627.1687727"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14589-6_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:55:03Z","timestamp":1606186503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14589-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145889","9783642145896"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14589-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}