{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:48:46Z","timestamp":1725518926260},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540880660"},{"type":"electronic","value":"9783540880677"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-88067-7_10","type":"book-chapter","created":{"date-parts":[[2008,10,9]],"date-time":"2008-10-09T04:38:39Z","timestamp":1223527119000},"page":"167-188","source":"Crossref","is-referenced-by-count":4,"title":["Indexing Structure for Graph-Structured Data"],"prefix":"10.1007","author":[{"given":"Stanislav","family":"Barto\u0148","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Zezula","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/67544.66950","volume-title":"Proceedings of the 1989 ACM SIGMOD international conference on Management of data","author":"R. Agrawal","year":"1989","unstructured":"Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: Proceedings of the 1989 ACM SIGMOD international conference on Management of data, pp. 253\u2013262. ACM Press, New York (1989)"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/88636.88888","volume":"15","author":"R. Agrawal","year":"1990","unstructured":"Agrawal, R., Dar, S., Jagadish, H.V.: Direct transitive closure algorithms: design and performance evaluation. ACM Transactions on Database Systems\u00a015(3), 427\u2013458 (1990)","journal-title":"ACM Transactions on Database Systems"},{"key":"10_CR3","first-page":"326","volume-title":"Proceedings of 16th International Conference on Very Large Data Bases","author":"R. Agrawal","year":"1990","unstructured":"Agrawal, R., Jagadish, H.V.: Hybrid transitive closure algorithms. In: McLeod, D., Sacks-Davis, R., Schek, H.-J. (eds.) Proceedings of 16th International Conference on Very Large Data Bases, Brisbane, Queensland, Australia, August 13-16, 1990, pp. 326\u2013334. Morgan Kaufmann, San Francisco (1990)"},{"key":"10_CR4","first-page":"664","volume-title":"Knowledge Information Systems","author":"Y. An","year":"2004","unstructured":"An, Y., Janssen, J., Milios, E.E.: Characterizing and mining the citation graph of the computer science literature. In: Knowledge Information Systems, vol.\u00a06, pp. 664\u2013678. Springer, New York (2004)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/775152.775249","volume-title":"Proceedings of the twelfth international conference on World Wide Web","author":"K. Anyanwu","year":"2003","unstructured":"Anyanwu, K., Sheth, A.: The \u03c1-operator: Enabling querying for semantic associations on the semantic web. In: Proceedings of the twelfth international conference on World Wide Web, pp. 690\u2013699. ACM Press, New York (2003)"},{"key":"10_CR6","unstructured":"Barton, S.: Indexing Graph Structured Data. PhD thesis, Faculty of Informatics, Masaryk University, Brno (May 2007)"},{"key":"10_CR7","unstructured":"Barto\u0148, S.: Indexing structure for discovering relationships in RDF graph recursively applying tree transformation. In: Proceedings of the Semantic Web Workshop at 27th Annual International ACM SIGIR Conference, pp. 58\u201368 (2004)"},{"key":"10_CR8","unstructured":"Barto\u0148, S., Zezula, P.: Rho-index - an index for graph structured data. In: 8th International Workshop of the DELOS Network of Excellence on Digital Libraries, pp. 57\u201364 (2005)"},{"key":"10_CR9","unstructured":"Brickley, D., Guha, R.V.: Resource Description Framework Schema specification (2000)"},{"key":"10_CR10","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: Proceedings of the 13th ACM-SIAM SODA, pp. 937\u2013946 (2002)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Cronen-Townsend, S., Zhou, Y., Croft, W.B.: Predicting query performance. In: Proceedings of the 25th Annual International ACM SIGIR conference on Research and Development in Information Retrieval (SIGIR 2002), pp. 299\u2013306 (August 2002)","DOI":"10.1145\/564376.564429"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/276675.276685","volume-title":"Digital Libraries 98 - The Third ACM Conference on Digital Libraries","author":"C.L. Giles","year":"1998","unstructured":"Giles, C.L., Bollacker, K., Lawrence, S.: CiteSeer: An automatic citation indexing system. In: Witten, I., Akscyn, R., Shipman III, F.M. (eds.) Digital Libraries 98 - The Third ACM Conference on Digital Libraries, Pittsburgh, PA, June 23\u201326, pp. 89\u201398. ACM Press, New York (1998)"},{"key":"10_CR13","unstructured":"Lassila, O., Swick, R.R.: Resource Description Framework: Model and Syntax specification (1999)"},{"key":"10_CR14","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. In: SODA 1990: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 319\u2013327 (1990)"},{"key":"10_CR15","unstructured":"Matono, A., Amagasa, T., Yoshikawa, M., Uemura, S.: An indexing scheme for RDF and RDF Schema based on suffix arrays. In: Proceedings of SWDB 2003, The first International Workshop on Semantic Web and Databases, Co-located with VLDB 2003 (2003)"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01940892","volume":"10","author":"P.W. Purdom","year":"1970","unstructured":"Purdom, P.W.: A transitive closure algorithm. BIT\u00a010, 76\u201394 (1970)","journal-title":"BIT"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal on computing, 146\u2013160 (1972)","DOI":"10.1137\/0201010"},{"issue":"3","key":"10_CR18","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1145\/322261.322273","volume":"28","author":"R.E. Tarjan","year":"1981","unstructured":"Tarjan, R.E.: Fast algorithms for solving path problems. J. ACM\u00a028(3), 594\u2013614 (1981)","journal-title":"J. ACM"},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/322261.322272","volume":"28","author":"R.E. Tarjan","year":"1981","unstructured":"Tarjan, R.E.: A unified approach to path problems. J. ACM\u00a028(3), 577\u2013593 (1981)","journal-title":"J. ACM"},{"key":"10_CR20","volume-title":"Spinning the Semantic Web","author":"S. Thacker","year":"2002","unstructured":"Thacker, S., Sheth, A., Patel, S.: Complex relationships for the semantic web. In: Fensel, D., Hendler, J., Liebermann, H., Wahlster, W. (eds.) Spinning the Semantic Web. MIT Press, Cambridge (2002)"},{"key":"10_CR21","unstructured":"Van Rijsbergen, C.J.: Information Retrieval, 2nd edition. Dept. of Computer Science, University of Glasgow (1979)"},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"Warshall, S.: A theorem on boolean matrices. Journal of the ACM\u00a09(1), 11\u201312 (1962)","journal-title":"Journal of the ACM"},{"issue":"4","key":"10_CR23","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/1114244.1114248","volume":"30","author":"X. Yan","year":"2005","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing based on discriminative frequent structure analysis. ACM Transactions on Database Systems\u00a030(4), 960\u2013993 (2005)","journal-title":"ACM Transactions on Database Systems"}],"container-title":["Studies in Computational Intelligence","Mining Complex Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88067-7_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:55:36Z","timestamp":1619524536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88067-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540880660","9783540880677"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88067-7_10","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[]}}