{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:25Z","timestamp":1725566665146},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540285663"},{"type":"electronic","value":"9783540317296"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11546924_55","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:09:19Z","timestamp":1127815759000},"page":"564-575","source":"Crossref","is-referenced-by-count":1,"title":["SIOUX: An Efficient Index for Processing Structural XQueries"],"prefix":"10.1007","author":[{"given":"Georges","family":"Gardarin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Yeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"55_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S1389-1286(02)00207-4","volume":"39","author":"S. Abiteboul","year":"2002","unstructured":"Abiteboul, S., Cluet, S., Ferran, G., Rousset, M.-C.: The Xyleme project. Computer Networks\u00a039(3), 225\u2013238 (2002)","journal-title":"Computer Networks"},{"key":"55_CR2","unstructured":"Al-Khalifa, S., Jagadish, H.V., Koudas, N., Patel, J.M., Srivastava, D., Wu, Y.: Structural joins: A primitive for efficient XML query pattern matching. In: Proceedings of the IEEE International Conference on Data Engineering (2002)"},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: Optimal xml pattern matching. In: Proc. of ACM SIGMOD (2002)","DOI":"10.1145\/564724.564727"},{"key":"55_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Q., Lim, A., Ong, K.W.: D(k)-index: An adaptive structural summary for graph-structured data. In: Proc. of SIGMOD (2003)","DOI":"10.1145\/872773.872776"},{"key":"55_CR5","doi-asserted-by":"crossref","unstructured":"Chien, S.-Y., Vagena, Z., Zhang, D., Tsotras, V.J., Zaniolo, C.: Efficient structural joins on indexed xml documents. In: Proc. of VLDB (2002)","DOI":"10.1016\/B978-155860869-6\/50031-7"},{"key":"55_CR6","doi-asserted-by":"crossref","unstructured":"Chung, C.-W., Min, J.-K., Shim, K.: APEX: an adaptive path index for XML data. In: SIGMOD Conference 2002, pp. 121\u2013132 (2002)","DOI":"10.1145\/564691.564706"},{"key":"55_CR7","unstructured":"Cooper, B., Sample, N., Franklin, M.J., Hjaltason, G.R., Shadmon, M.: A Fast Index for Semistructured Data. In: VLDB 2001, pp. 341\u2013350 (2001)"},{"key":"55_CR8","doi-asserted-by":"crossref","unstructured":"Dietz, P.F.: Maintaining order in a linked list. In: ACM Symposium on Theory of Computing, pp. 122\u2013127 (1982)","DOI":"10.1145\/800070.802184"},{"issue":"3","key":"55_CR9","first-page":"27","volume":"22","author":"D. Florescu","year":"1999","unstructured":"Florescu, D., Kossmann, D.: Storing and Querying XML Data using an RDMBS. IEEE Data Eng. Bull.\u00a022(3), 27\u201334 (1999)","journal-title":"IEEE Data Eng. Bull."},{"key":"55_CR10","unstructured":"Goldman, R., Widom, J.: DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases. In: VLDB 1997, pp. 436\u2013445 (1997)"},{"key":"55_CR11","unstructured":"Jiang, H., Lu, H., Wang, W., Ooi, B.C.: XR-Tree: Indexing XML Data for Efficient Structural Joins. In: ICDE 2003, pp. 253\u2013263 (2003)"},{"key":"55_CR12","unstructured":"Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting slocal similarity for indexing paths in graph-structured data. In: Proc. of ICDE (2002)"},{"key":"55_CR13","unstructured":"Kilpel\u00e4inen, P.: Tree Matching Problems with Applications to Structured Text Databases. PHD Dissertation, University of Helsinki (1992)"},{"key":"55_CR14","doi-asserted-by":"crossref","unstructured":"Lee, Y.K., Yoo, S.-J., Yoon, K., Berra, P.B.: Index Structures for Structured Documents. In: Digital Libraries 1996, pp. 91\u201399 (1996)","DOI":"10.1145\/226931.226950"},{"key":"55_CR15","unstructured":"Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: VLDB 2001, pp. 361\u2013370 (2001)"},{"key":"55_CR16","unstructured":"Lore, a DBMS for XML, \n                  \n                    http:\/\/www-db.stanford.edu\/lore\/"},{"key":"55_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-49257-7_18","volume-title":"Database Theory - ICDT\u201999","author":"T. Milo","year":"1998","unstructured":"Milo, T., Suciu, D.: Index Structures for Path Expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 277\u2013295. Springer, Heidelberg (1998)"},{"key":"55_CR18","unstructured":"Rao, P.R., Moon, B.: Prix: Indexing and querying xml using prufer sequences. In: Proc. of ICDE (2004)"},{"key":"55_CR19","doi-asserted-by":"crossref","unstructured":"Wang, H., Park, S., Fan, W., Yu, P.S.: ViST: A dynamic index method for querying xml data by tree structures. In: Proc. of ACM SIGMOD (2003)","DOI":"10.1145\/872757.872774"},{"key":"55_CR20","unstructured":"X-Hive\/DB: Advanced XML data processing and storage, \n                  \n                    http:\/\/www.x-hive.com"},{"key":"55_CR21","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P., Han, J.: Graph Indexing: A Frequent Structure-based Approach. In: SIGMOD 2004, pp. 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"55_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On supporting containment queries in relational database management systems. In: Proc. of SIGMOD (2001)","DOI":"10.1145\/375663.375722"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11546924_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:07:18Z","timestamp":1558292838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11546924_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285663","9783540317296"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11546924_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}