{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:50:35Z","timestamp":1742914235992,"version":"3.40.3"},"publisher-location":"Dordrecht","reference-count":59,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789048197934"},{"type":"electronic","value":"9789048197941"}],"license":[{"start":{"date-parts":[[2010,8,18]],"date-time":"2010-08-18T00:00:00Z","timestamp":1282089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,8,18]],"date-time":"2010-08-18T00:00:00Z","timestamp":1282089600000},"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":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-90-481-9794-1_26","type":"book-chapter","created":{"date-parts":[[2010,9,17]],"date-time":"2010-09-17T21:21:08Z","timestamp":1284758468000},"page":"127-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Data Engineering in Graph Databases"],"prefix":"10.1007","author":[{"given":"Byron","family":"Choi","sequence":"first","affiliation":[]},{"given":"Haibo","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Jianliang","family":"Xu","sequence":"additional","affiliation":[]},{"given":"William K. W.","family":"Cheung","sequence":"additional","affiliation":[]},{"given":"Chun-Hung","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jiming","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,18]]},"reference":[{"key":"26_CR1_26","volume-title":"Data on the web : from relations to semistructured data and XML","author":"S. Abiteboul","year":"2000","unstructured":"S. Abiteboul, P. Buneman, and D. Suciu. Data on the web : from relations to semistructured data and XML. Morgan Kaufmann, San Francisco, 2000."},{"key":"26_CR2_26","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s007990050001","volume":"1","author":"S. Abiteboul","year":"1997","unstructured":"S. Abiteboul, D. Quass, J. Mchugh, J. Widom, and J. Wiener. The Lorel query language for semistructured data. International Journal on Digital Libraries, 1:68\u201388, 1997.","journal-title":"International Journal on Digital Libraries"},{"issue":"1","key":"26_CR3_26","first-page":"361","volume":"2","author":"D. Agrawal","year":"2009","unstructured":"D. Agrawal, D. Ganesan, R. K. Sitaraman, Y. Diao, and S. Singh. Lazy-adaptive tree: An optimized index structure for flash devices. PVLDB, 2(1):361\u2013372, 2009.","journal-title":"PVLDB"},{"issue":"6","key":"26_CR4_26","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1007\/s00778-009-0141-6","volume":"18","author":"R. Bramandia","year":"2009","unstructured":"R. Bramandia, J. Cheng, B. Choi, and J. X. Yu. Optimizing updates of recursive XML views of relations. The VLDB Journal, 18(6):1313\u20131333, 2009.","journal-title":"The VLDB Journal"},{"key":"26_CR5_26","doi-asserted-by":"crossref","unstructured":"R. Bramandia, B. Choi, and W. K. Ng. On incremental maintenance of 2-hop labeling of graphs. In WWW, pages 845\u2013854, 2008.","DOI":"10.1145\/1367497.1367611"},{"key":"26_CR6_26","first-page":"682","volume":"22","author":"R. Bramandia","year":"2010","unstructured":"R. Bramandia, B. Choi, and W. K. Ng. Incremental maintenance of 2-hop labeling of large graphs. TKDE, 22:682\u2013698, 2010.","journal-title":"TKDE"},{"issue":"1","key":"26_CR7_26","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/s007780050084","volume":"9","author":"P. Buneman","year":"2000","unstructured":"P. Buneman, M. Fernandez, and D. Suciu. UnQL: a query language and algebra for semistructured data based on structural recursion. The VLDB Journal, 9(1):76\u2013110, 2000.","journal-title":"The VLDB Journal"},{"key":"26_CR8_26","doi-asserted-by":"crossref","unstructured":"D. Chamberlin, J. Robie, and D. Florescu. Quilt: An XML query language for heterogeneous data sources. In LNCS; Vol. 1997, pages 1\u201325. Springer-Verlag, 2000.","DOI":"10.1007\/3-540-45271-0_1"},{"key":"26_CR9_26","unstructured":"C. Chen, X. Yan, P. S. Yu, J. Han, D.-Q. Zhang, and X. Gu. Towards graph containment search and indexing. In VLDB, pages 926\u2013937, 2007."},{"key":"26_CR10_26","doi-asserted-by":"crossref","unstructured":"Q. Chen, A. Lim, and K. W. Ong. D(k)-index: an adaptive structural summary for graphstructured data. In SIGMOD, pages 134\u2013144, 2003.","DOI":"10.1145\/872757.872776"},{"key":"26_CR11_26","doi-asserted-by":"crossref","unstructured":"J. Cheng, Y. Ke, W. Ng, and A. Lu. FG-index: towards verification-free query processing on graph databases. In SIGMOD, pages 857\u2013872, 2007.","DOI":"10.1145\/1247480.1247574"},{"key":"26_CR12_26","doi-asserted-by":"crossref","unstructured":"J. Cheng, J. X. Yu, X. Lin, H. Wang, and P. S. Yu. Fast computation of reachability labeling for large graphs. In EDBT, pages 961\u2013979, 2006.","DOI":"10.1007\/11687238_56"},{"issue":"5","key":"26_CR13_26","first-page":"1338","volume":"32","author":"E. Cohen","year":"2003","unstructured":"E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. Journal of Computing, 32(5):1338\u20131355, 2003.","journal-title":"Journal of Computing"},{"key":"26_CR14_26","unstructured":"A. Deutsch, M. Fernandez, D. Florescu, A. Levy, and D. Suciu. XML-QL: A query language for XML. http:\/\/www.w3.org\/TR\/NOTE-xml-ql\/, 1998."},{"issue":"3","key":"26_CR15_26","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.989932","volume":"35","author":"G. W. Flake","year":"2002","unstructured":"G. W. Flake, S. Lawrence, C. L. Giles, and F. M. Coetzee. Self-organization and identification of web communities. Computer, 35(3):66\u201371, 2002.","journal-title":"Computer"},{"key":"26_CR16_26","unstructured":"R. Goldman and J. Widom. Dataguides: Enabling query formulation and optimization in semistructured databases. In VLDB, pages 436\u2013445, 1997."},{"key":"26_CR17_26","doi-asserted-by":"crossref","unstructured":"G. Jeh and J. Widom. Mining the space of graph properties. In SIGKDD, pages 187\u2013196, 2004.","DOI":"10.1145\/1014052.1014075"},{"key":"26_CR18_26","doi-asserted-by":"crossref","unstructured":"H. Jiang, H. Wang, P. S. Yu, and S. Zhou. Gstring: A novel approach for efficient search in graph databases. In ICDE, pages 566\u2013575, 2007.","DOI":"10.1109\/ICDE.2007.367902"},{"key":"26_CR19_26","doi-asserted-by":"crossref","unstructured":"C. Jin, S. S. Bhowmick, X. Xiao, J. Cheng, and B. Choi. Gblender: Towards blending visual query formulation and query processing in graph databases. In SIGMOD, 2010.","DOI":"10.1145\/1807167.1807182"},{"key":"26_CR20_26","doi-asserted-by":"crossref","unstructured":"R. Kaushik, P. Shenoy, P. Bohannon, and E. Gudes. Exploiting local similarity for indexing paths in graph-structured data. In ICDE, page 129, 2002.","DOI":"10.1109\/ICDE.2002.994703"},{"key":"26_CR21_26","first-page":"13","volume-title":"TCON\u201995","author":"A. Kawaguchi","year":"1995","unstructured":"A. Kawaguchi, S. Nishioka, and H. Motoda. A flash-memory based file system. In TCON\u201995, pages 13\u201313, Berkeley, CA, USA, 1995. USENIX Association."},{"issue":"5","key":"26_CR22_26","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J. M. Kleinberg","year":"1999","unstructured":"J. M. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5):604\u2013632, 1999.","journal-title":"J. ACM"},{"key":"26_CR23_26","doi-asserted-by":"crossref","unstructured":"M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, pages 313\u2013320, 2001.","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"9","key":"26_CR24_26","first-page":"1038","volume":"16","author":"M. Kuramochi","year":"2004","unstructured":"M. Kuramochi and G. Karypis. An efficient algorithm for discovering frequent subgraphs. TKDE, 16(9):1038\u20131051, 2004.","journal-title":"TKDE"},{"key":"26_CR25_26","doi-asserted-by":"crossref","unstructured":"S.-W. Lee and B. Moon. Design of flash-based DBMS: an in-page logging approach. In SIGMOD, pages 55\u201366, 2007.","DOI":"10.1145\/1247480.1247488"},{"issue":"1","key":"26_CR26_26","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1093\/bioinformatics\/bti1105","volume":"21","author":"U. Leser","year":"2005","unstructured":"U. Leser. A query language for biological networks. Bioinformatics, 21(1):33\u201339, 2005.","journal-title":"Bioinformatics"},{"key":"26_CR27_26","doi-asserted-by":"crossref","unstructured":"J. Li, W. K. Cheung, J. Liu, and C. H. Li. On discovering community trends in social networks. WIIAT, pages 230\u2013237, 2009.","DOI":"10.1109\/WI-IAT.2009.40"},{"key":"26_CR28_26","doi-asserted-by":"crossref","unstructured":"Y. Li, B. He, Q. Luo, and K. Yi. Tree indexing on flash disks. In ICDE, pages 1303\u20131306, 2009.","DOI":"10.1109\/ICDE.2009.226"},{"key":"26_CR29_26","doi-asserted-by":"crossref","unstructured":"Y. Li, S. T. On, J. Xu, B. Choi, and H. Hu. Digestjoin: Exploiting fast random reads for flash-based joins. In MDM, pages 152\u2013161, 2009.","DOI":"10.1109\/MDM.2009.26"},{"key":"26_CR30_26","doi-asserted-by":"crossref","unstructured":"Z. Lin, B. He, and B. Choi. A quantitative summary of XML structures. In ER, pages 228\u2013240, 2006.","DOI":"10.1007\/11901181_18"},{"key":"26_CR31_26","doi-asserted-by":"crossref","unstructured":"T. Milo and D. Suciu. Index structures for path expressions. In ICDT, 1999.","DOI":"10.1007\/3-540-49257-7_18"},{"key":"26_CR32_26","unstructured":"S. T. On, H. Hu, Y. Li, and J. Xu. Lazy-update B+-tree for flash devices. In MDM, pages 323\u2013328, 2009."},{"issue":"7043","key":"26_CR33_26","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G. Palla","year":"2005","unstructured":"G. Palla, I. Derenyi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435(7043):814\u2013818, 2005.","journal-title":"Nature"},{"key":"26_CR34_26","doi-asserted-by":"crossref","unstructured":"P. Pons and M. Latapy. Computing communities in large networks using random walks. In ISCIS, pages 284\u2013293, 2005.","DOI":"10.1007\/11569596_31"},{"issue":"9","key":"26_CR35_26","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F. Radicchi","year":"2004","unstructured":"F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi. Defining and identifying communities in networks. PNAS, 101(9):2658\u20132663, 2004.","journal-title":"PNAS"},{"key":"26_CR36_26","doi-asserted-by":"crossref","unstructured":"R. Schenkel, A. Theobald, and G. Weikum. Hopi: An efficient connection index for complex XML document collections. In EDBT, pages 237\u2013255, 2004.","DOI":"10.1007\/978-3-540-24741-8_15"},{"key":"26_CR37_26","unstructured":"R. Schenkel, A. Theobald, and G. Weikum. Efficient creation and incremental maintenance of the hopi index for complex XML document collections. In ICDE, pages 360\u2013371, 2005."},{"key":"26_CR38_26","unstructured":"J. Scott. Social Network Analysis: A Handbook. Sage Publications, second. edition, 2000."},{"key":"26_CR39_26","doi-asserted-by":"crossref","unstructured":"M. A. Shah, S. Harizopoulos, J. L. Wiener, and G. Graefe. Fast scans and joins using flash drives. In DaMoN, pages 17\u201324, 2008.","DOI":"10.1145\/1457150.1457154"},{"issue":"1","key":"26_CR40_26","first-page":"364","volume":"1","author":"H. Shang","year":"2008","unstructured":"H. Shang, Y. Zhang, X. Lin, and J. X. Yu. Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB, 1(1):364\u2013375, 2008.","journal-title":"PVLDB"},{"key":"26_CR41_26","unstructured":"J. Shi and J. Malik. Normalized cuts and image segmentation. In CVPR, page 731, 1997."},{"issue":"5","key":"26_CR42_26","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/1060710.1060718","volume":"48","author":"M. Stonebraker","year":"2005","unstructured":"M. Stonebraker et al. The Lowell database research self-assessment. Comm. of the ACM, 48(5):111\u2013118, 2005.","journal-title":"Comm. of the ACM"},{"key":"26_CR43_26","doi-asserted-by":"crossref","unstructured":"S. Tri\u03b2l and U. Leser. Fast and practical indexing and querying of very large graphs. In SIGMOD, pages 845\u2013856, 2007.","DOI":"10.1145\/1247480.1247573"},{"key":"26_CR44_26","unstructured":"O. Udrea, A. Pugliese, and V. S. Subrahmanian. GRIN: a graph based RDF index. In ICAI, pages 1465\u20131470, 2007."},{"issue":"1","key":"26_CR45_26","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J. R. Ullmann","year":"1976","unstructured":"J. R. Ullmann. An algorithm for subgraph isomorphism. JACM, 23(1):31\u201342, 1976.","journal-title":"JACM"},{"key":"26_CR46_26","unstructured":"W3C. OWL web ontology language overview. http:\/\/www.w3.org\/TR\/owl-features, 2004."},{"key":"26_CR47_26","unstructured":"W3C. SPARQL query language for RDF. http:\/\/www.w3.org\/TR\/rdf-sparql-query, 2008."},{"key":"26_CR48_26","doi-asserted-by":"crossref","unstructured":"H. Wang, H. He, J. Yang, P. S. Yu, and J. X. Yu. Dual labeling: Answering graph reachability queries in constant time. In ICDE, page 75, 2006.","DOI":"10.1109\/ICDE.2006.53"},{"key":"26_CR49_26","doi-asserted-by":"crossref","unstructured":"X. Wu, M. L. Lee, and W. Hsu. A prime number labeling scheme for dynamic ordered XML trees. In ICDE, page 66, 2004.","DOI":"10.1109\/ICDE.2004.1319985"},{"key":"26_CR50_26","unstructured":"X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM, page 721, 2002."},{"key":"26_CR51_26","doi-asserted-by":"crossref","unstructured":"X. Yan, P. S. Yu, and J. Han. Graph indexing: a frequent structure-based approach. In SIGMOD, pages 335\u2013346, 2004.","DOI":"10.1145\/1007568.1007607"},{"issue":"4","key":"26_CR52_26","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/1114244.1114248","volume":"30","author":"X. Yan","year":"2005","unstructured":"X. Yan, P. S. Yu, and J. Han. Graph indexing based on discriminative frequent structure analysis. TODS, 30(4):960\u2013993, 2005.","journal-title":"TODS"},{"key":"26_CR53_26","doi-asserted-by":"crossref","unstructured":"X. Yan, P. S. Yu, and J. Han. Substructure similarity search in graph databases. In SIGMOD, pages 766\u2013777, 2005.","DOI":"10.1145\/1066157.1066244"},{"issue":"10","key":"26_CR54_26","first-page":"1333","volume":"19","author":"B. Yang","year":"2007","unstructured":"B. Yang, W. Cheung, and J. Liu. Community mining from signed social networks. TKDE, 19(10):1333\u20131348, 2007.","journal-title":"TKDE"},{"issue":"2","key":"26_CR55_26","first-page":"123","volume":"20","author":"B. Yang","year":"2010","unstructured":"B. Yang, J. Liu, and D. Liu. An autonomy-oriented computing approach to community mining in distributed and dynamic networks. AAMAS, 20(2):123\u2013157, 2010.","journal-title":"AAMAS"},{"key":"26_CR56_26","doi-asserted-by":"crossref","unstructured":"C. Zhang, J. F. Naughton, D. J. DeWitt, Q. Luo, and G. Lohman. On supporting containment queries in relational database management systems. In SIGMOD, pages 425\u2013436, 2001.","DOI":"10.1145\/376284.375722"},{"key":"26_CR57_26","doi-asserted-by":"crossref","unstructured":"S. Zhang, J. Li, H. Gao, and Z. Zou. A novel approach for efficient supergraph query processing on graph databases. In EDBT, pages 204\u2013215, 2009.","DOI":"10.1145\/1516360.1516385"},{"key":"26_CR58_26","unstructured":"P. Zhao, J. X. Yu, and P. S. Yu. Graph indexing: tree + delta <= graph. In VLDB, pages 938\u2013949, 2007."},{"key":"26_CR59_26","doi-asserted-by":"crossref","unstructured":"L. Zou, L. Chen, J. X. Yu, and Y. Lu. A novel spectral coding in a large graph database. In EDBT, pages 181\u2013192, 2008.","DOI":"10.1145\/1353343.1353369"}],"container-title":["Lecture Notes in Electrical Engineering","Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-90-481-9794-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T22:21:24Z","timestamp":1740522084000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-90-481-9794-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,18]]},"ISBN":["9789048197934","9789048197941"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-90-481-9794-1_26","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2010,8,18]]},"assertion":[{"value":"18 August 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}