{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:04:29Z","timestamp":1725573869024},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210474"},{"type":"electronic","value":"9783540245711"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24571-1_4","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T10:32:42Z","timestamp":1294396362000},"page":"52-62","source":"Crossref","is-referenced-by-count":0,"title":["SF-Tree: An Efficient and Flexible Structure for Estimating Selectivity of Simple Path Expressions with Statistical Accuracy Guarantee"],"prefix":"10.1007","author":[{"given":"Wai-Shing","family":"Ho","sequence":"first","affiliation":[]},{"given":"Ben","family":"Kao","sequence":"additional","affiliation":[]},{"given":"David W.","family":"Cheung","sequence":"additional","affiliation":[]},{"given":"YIP Chi","family":"Lap","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Lo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Aboulnaga, A., Alameldeen, A., Naughton, J.: Estimating the selectivity of XML path expressions for internet scale applications. In: VLDB, pp. 591\u2013600 (2001)"},{"key":"4_CR2","unstructured":"Chen, Z., Jagadish, H.V., Korn, F., Koudas, N., Muthukrishnan, S., Ng, R., Srivastava, D.: Counting twig matches in a tree. In: ICDE, pp. 595\u2013604 (2001)"},{"key":"4_CR3","unstructured":"Diaz, A.L., Lovell, D.: XML data generator (September 1999), http:\/\/www.alphaworks.ibm.com\/tech\/xmlgenerator"},{"issue":"4","key":"4_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/2275.357411","volume":"2","author":"C. Faloutsos","year":"1984","unstructured":"Faloutsos, C., Christodoulakis, S.: Signature files: An access method for documents and its analytical performance evaluation. ACM TOIS\u00a02(4), 267\u2013288 (1984)","journal-title":"ACM TOIS"},{"key":"4_CR5","unstructured":"Goldman, R., Widom, J.: DataGuides: Enabling query formulation and optimization in semistructured databases. In: VLDB, pp. 436\u2013445 (1997)"},{"key":"4_CR6","unstructured":"Ho, W.-S., Kao, B., Cheung, D.W., Chi Lap [Beta], Y., Lo, E.: SF-Tree: An efficient and flexible structure for selectivity estimation. Technical Report TR-2003-08, The University of Hong Kong (December 2003)"},{"key":"4_CR7","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol.\u00a03. Addison-Wesley, Reading (1973)"},{"key":"4_CR8","unstructured":"Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: VLDB, pp. 361\u2013370 (2001)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Lim, L., Wang, M., Padmanabhan, S., Vitter, J.S., Parr, R.: XPathLearner: an on-line self-tuning markov histogram for XML path selectivity estimation. In: VLDB, pp. 442\u2013453 (2002)","DOI":"10.1016\/B978-155860869-6\/50046-9"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Milo, T., Suciu, D.: Index structures for path expressions. In: ICDT 1999, pp. 277\u2013295 (1999)","DOI":"10.1007\/3-540-49257-7_18"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Polyzotis, N., Garofalakis, M.: Statistical synopses for graph-structured XML databases. In: SIGMOD, pp. 358\u2013369 (2002)","DOI":"10.1145\/564691.564733"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Polyzotis, N., Garofalakis, M.: Structure and value synopses for XML data graphs. In: VLDB, pp. 466\u2013477 (2002)","DOI":"10.1016\/B978-155860869-6\/50048-2"},{"key":"4_CR13","unstructured":"Schmidt, A.R., Waas, F., Kersten, M.L., Florescu, D., Manolescu, I., Carey, M.J., Busse, R.: The XML Benchmark Project. Technical Report INS-R0103, CWI, Amsterdam, The Netherlands (April 2001)"},{"key":"4_CR14","series-title":"Lecture Notes Series on Computing","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1142\/9789814317368_0004","volume-title":"String Searching Algorithms","author":"G.A. Stephen","year":"1994","unstructured":"Stephen, G.A.: Suffix Trees. In: String Searching Algorithms. Lecture Notes Series on Computing, vol.\u00a03, pp. 87\u2013110. World Scientific, Singapore (1994)"},{"key":"4_CR15","unstructured":"W3C. Extensible markup language (XML) 1.0 (February 1998), http:\/\/www.w3.org\/TR\/1998\/REC-xml-19980210"},{"key":"4_CR16","unstructured":"W3C. XML path language (XPath) version 1.0 (November 1999)"},{"key":"4_CR17","unstructured":"W3C. XQuery 1.0: An XML query language (June 2001), http:\/\/www.w3.org\/TR\/xquery"}],"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-540-24571-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T13:43:01Z","timestamp":1559914981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24571-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210474","9783540245711"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24571-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}