{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:09Z","timestamp":1775282289215,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3735,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0022-0000(03)00028-x","type":"journal-article","created":{"date-parts":[[2003,6,21]],"date-time":"2003-06-21T00:11:16Z","timestamp":1056154276000},"page":"763-774","source":"Crossref","is-referenced-by-count":15,"title":["Two-dimensional substring indexing"],"prefix":"10.1016","volume":"66","author":[{"given":"Paolo","family":"Ferragina","sequence":"first","affiliation":[]},{"given":"Nick","family":"Koudas","sequence":"additional","affiliation":[]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[]},{"given":"Divesh","family":"Srivastava","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00028-X_BIB1","series-title":"Advances in Discrete and Computational Geometry","article-title":"Geometric range searching and its relatives","author":"Agarwal","year":"1998"},{"key":"10.1016\/S0022-0000(03)00028-X_BIB2","doi-asserted-by":"crossref","unstructured":"L. Arge, V. Samoladas, J.S. Vitter, On two-dimensional indexability and optimal range search indexing, Proceedings of ACM Principles of Database Systems (PODS), Philadelphia, PA, 1999, pp. 346\u2013357.","DOI":"10.1145\/303976.304010"},{"issue":"1","key":"10.1016\/S0022-0000(03)00028-X_BIB3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/320521.320530","article-title":"Prefix B-trees","volume":"2","author":"Bayer","year":"1977","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/S0022-0000(03)00028-X_BIB4","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger, The R*-tree: an efficient and robust access method for points and rectangles, Proceedings of ACM SIGMOD, Atlantic City, NJ, 1990, pp. 220\u2013231.","DOI":"10.1145\/93597.98741"},{"issue":"2","key":"10.1016\/S0022-0000(03)00028-X_BIB5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/301970.301973","article-title":"The string B-tree","volume":"46","author":"Ferragina","year":"1999","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0022-0000(03)00028-X_BIB6","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","article-title":"Multidimensional access methods","volume":"30","author":"Gaede","year":"1998","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0022-0000(03)00028-X_BIB7","unstructured":"G. Gonnet, R. Baeza-Yates, T. Snider, New indices for text: PAT trees and PAT arrays, in: Information Retrieval: Data Structures and Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1992."},{"key":"10.1016\/S0022-0000(03)00028-X_BIB8","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1006\/jagm.1995.1038","article-title":"Further results on generalized intersection searching problems: counting, reporting, and dynamization","volume":"19","author":"Gupta","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/S0022-0000(03)00028-X_BIB9","doi-asserted-by":"crossref","unstructured":"A. Guttman, R-trees: a dynamic index structure for spatial searching, Proceedings of ACM SIGMOD, Boston, MA, 1984, pp. 47\u201357.","DOI":"10.1145\/602259.602266"},{"key":"10.1016\/S0022-0000(03)00028-X_BIB10","doi-asserted-by":"crossref","unstructured":"H.V. Jagadish, N. Koudas, D. Srivastava, On effective multi-dimensional indexing for strings, Proceedings of ACM SIGMOD, Dallas, TX, 2000, pp. 403\u2013414.","DOI":"10.1145\/342009.335434"},{"issue":"5","key":"10.1016\/S0022-0000(03)00028-X_BIB11","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","article-title":"Suffix arrays","volume":"22","author":"Manber","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00028-X_BIB12","doi-asserted-by":"crossref","unstructured":"Y. Matias, S. Muthukrishnan, S. Sahinalp, J. Ziv, Augmenting suffix trees with applications, Proceedings of European Symposium on Algorithms, Venice, Italy, 1998, pp. 67\u201378.","DOI":"10.1007\/3-540-68530-8_6"},{"key":"10.1016\/S0022-0000(03)00028-X_BIB13","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/S0022-0000(03)00028-X_BIB14","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","article-title":"PATRICIA","volume":"15","author":"Morrison","year":"1968","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(03)00028-X_BIB15","series-title":"The Design and Analysis of Spatial Data Structures","author":"Samet","year":"1990"},{"key":"10.1016\/S0022-0000(03)00028-X_BIB16","unstructured":"T. Sellis, N. Roussopoulos, C. Faloutsos, The R+-tree: a dynamic index for multi-dimensional data, Proceedings of VLDB, Brighton, England, 1987, pp. 507\u2013518."},{"key":"10.1016\/S0022-0000(03)00028-X_BIB17","doi-asserted-by":"crossref","unstructured":"J.S. Vitter, E.A.M. Shriver, Optimal disk I\/O with parallel block transfer, Proceedings of Symposium on Theory of Computing (STOC), Baltimore, MD, 1990, pp. 159\u2013169.","DOI":"10.1145\/100216.100234"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000300028X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000300028X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T06:20:53Z","timestamp":1553062853000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002200000300028X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S002200000300028X"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00028-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}