{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:45:06Z","timestamp":1725504306440},"reference-count":34,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0306-4379(98)00029-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:22:28Z","timestamp":1027621348000},"page":"567-588","source":"Crossref","is-referenced-by-count":4,"title":["The suffix-signature method for searching for phrases in text"],"prefix":"10.1016","volume":"23","author":[{"given":"Mei","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank Wm.","family":"Tompa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0306-4379(98)00029-5_BIB1","first-page":"255","article-title":"Algorithms for finding patterns in strings","volume":"Volume A","author":"Aho","year":"1990"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB2","article-title":"Efficient Text Searching","author":"Baeza-Yates","year":"1989"},{"issue":"1","key":"10.1016\/S0306-4379(98)00029-5_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 Transactions on Database Systems"},{"issue":"10","key":"10.1016\/S0306-4379(98)00029-5_BIB4","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","article-title":"A fast string searching algorithm","volume":"20","author":"Boyer","year":"1977","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB5","article-title":"Compact Pat Trees","author":"Clark","year":"1996"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB6","series-title":"AFIPS Western JCC","first-page":"295","article-title":"File searching using variable length keys","author":"de la Briandais","year":"1959"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB7","first-page":"435","article-title":"Overview of the full-text document retrieval benchmark","author":"DeFazio","year":"1993"},{"issue":"1","key":"10.1016\/S0306-4379(98)00029-5_BIB8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/4078.4080","article-title":"Access methods for text","volume":"17","author":"Faloutsos","year":"1985","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB9","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1007\/BF01954894","article-title":"Signature files: An integrated access method for text and attributes, suitable for optical disk storage","volume":"28","author":"Faloutsos","year":"1988","journal-title":"Bit"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB10","series-title":"Information Retrieval: Data Structures & Algorithms","first-page":"44","article-title":"Signature files","author":"Faloutsos","year":"1992"},{"issue":"4","key":"10.1016\/S0306-4379(98)00029-5_BIB11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1145\/2275.357411","article-title":"Signature files: an access method for documents and its analytical performance evaluation","volume":"2","author":"Faloutsos","year":"1984","journal-title":"ACM Transactions on Office Information Systems"},{"issue":"3","key":"10.1016\/S0306-4379(98)00029-5_BIB12","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1137\/0215054","article-title":"Digital search trees revisited","volume":"15","author":"Flajolet","year":"1986","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB13","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","article-title":"Trie memory","volume":"3","author":"Fredkin","year":"1960","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB14","series-title":"International Workshop on the Web and Databases","first-page":"42","article-title":"Interactive query and search in semistructured databases","author":"Goldman","year":"1998"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB15","series-title":"Proceedings of the Second ACM SIGACT-SIGMOD Symposium Principles of Database System","first-page":"117","article-title":"Unstructured data bases or very efficient text searching","author":"Gonnet","year":"1983"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB16","article-title":"Efficient searching of text and pictures (extended abstract)","author":"Gonnet","year":"1988"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB17","series-title":"Information Retrieval: Data Structures & Algorithms","first-page":"66","article-title":"New indices for text: pat trees and pat arrays","author":"Gonnet","year":"1992"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB18","series-title":"Proceedings of the ACM Symposium on Principles of Database Systems","first-page":"256","article-title":"External hashing with limited internal storage","author":"Gonnet","year":"1982"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB19","series-title":"Information Retrieval: Data Structures & Algorithms","first-page":"28","article-title":"Inverted files","author":"Harman","year":"1992"},{"issue":"2","key":"10.1016\/S0306-4379(98)00029-5_BIB20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","article-title":"Efficient randomized pattern-matching algorithm","volume":"31","author":"Karp","year":"1987","journal-title":"IBM Journal of Research and Development"},{"issue":"3","key":"10.1016\/S0306-4379(98)00029-5_BIB21","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1093\/comjnl\/18.3.265","article-title":"Hashing functions","volume":"18","author":"Knott","year":"1975","journal-title":"The Computer Journal"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB22","volume":"volume 3","author":"Knuth","year":"1973"},{"issue":"2","key":"10.1016\/S0306-4379(98)00029-5_BIB23","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"10.1016\/S0306-4379(98)00029-5_BIB24","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(91)90032-D","article-title":"An algorithm for string matching with a sequence of don't cares","volume":"37","author":"Manber","year":"1991","journal-title":"Information Processing Letters"},{"issue":"5","key":"10.1016\/S0306-4379(98)00029-5_BIB25","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","article-title":"Suffix arrays: a new method for on-line string searches","volume":"22","author":"Manber","year":"1993","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB26","article-title":"Glimpse: a tool to search through entire file systems","author":"Manber","year":"1993"},{"issue":"4","key":"10.1016\/S0306-4379(98)00029-5_BIB27","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","article-title":"Patricia-practical algorithm to retrieve information coded in alphanumeric","volume":"15","author":"Morrison","year":"1968","journal-title":"Journal of the ACM"},{"issue":"4","key":"10.1016\/S0306-4379(98)00029-5_BIB28","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1145\/263479.263482","article-title":"Proximal nodes: a model to query document databases by content and structure","volume":"15","author":"Navarro","year":"1997","journal-title":"ACM Transactions on Information Systems"},{"issue":"11","key":"10.1016\/S0306-4379(98)00029-5_BIB29","first-page":"1335","article-title":"Database systems for structured documents","volume":"E78-D","author":"Sacks-Davis","year":"1995","journal-title":"IEICE Transactions on Information and Systems"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB30","article-title":"Trie Methods for Text and Spatial Data on Secondary Storage","author":"Shang","year":"1995"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB31","author":"Swokowski","year":"1981"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB32","author":"Witten","year":"1994"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB33","series-title":"ACM SIGIR 95","first-page":"261","article-title":"A new character-based indexing method using frequency data for Japanese documents","author":"Yasushi","year":"1995"},{"key":"10.1016\/S0306-4379(98)00029-5_BIB34","first-page":"198","article-title":"The Suffix-Signature Method for Searching for Phrases in Text","author":"Zhou","year":"1997"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437998000295?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437998000295?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:23:36Z","timestamp":1556058216000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437998000295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":34,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0306437998000295"],"URL":"https:\/\/doi.org\/10.1016\/s0306-4379(98)00029-5","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}