{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T16:55:52Z","timestamp":1649004952559},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s0169-023x(99)00017-8","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T22:25:53Z","timestamp":1048631153000},"page":"29-49","source":"Crossref","is-referenced-by-count":1,"title":["A compact sparse matrix representation using random hash functions"],"prefix":"10.1016","volume":"32","author":[{"given":"Ji-Han","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Chen","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tung-Shou","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0169-023X(99)00017-8_BIB1","series-title":"Principles of Compiler Design","author":"Aho","year":"1977"},{"key":"10.1016\/S0169-023X(99)00017-8_BIB2","unstructured":"C.C. Chang, J.H. Jiang, T.S. Chen, Rehash method: A compression technique of sparse binary-matrices, Technical Report of the Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan, 1996"},{"issue":"1","key":"10.1016\/S0169-023X(99)00017-8_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/spe.4380210104","article-title":"A letter-oriented perfect hashing scheme based upon sparse table compression","volume":"21","author":"Chang","year":"1991","journal-title":"Software-Practice and Experience"},{"issue":"3","key":"10.1016\/S0169-023X(99)00017-8_BIB4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1109\/TSE.1983.236866","article-title":"The study of a new perfect hash function","volume":"SE-9","author":"Du","year":"1983","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0169-023X(99)00017-8_BIB5","series-title":"Fundamentals of Data Structures","author":"Horowitz","year":"1976"},{"issue":"1","key":"10.1016\/S0169-023X(99)00017-8_BIB6","first-page":"1","article-title":"Global study on data compression techniques for digital chinese character patterns","volume":"139","author":"Ju","year":"1992","journal-title":"IEEE Proceedings-E"},{"key":"10.1016\/S0169-023X(99)00017-8_BIB7","unstructured":"D.E. Knuth, The Art of Computer Programming, Fundamental Algorithms, vol. 1, Addison-Wesley, Reading, MA, 1973a"},{"key":"10.1016\/S0169-023X(99)00017-8_BIB8","unstructured":"D.E. Knuth, The Art of Computer Programming, Fundamental Algorithms, vol. 3, Addison-Wesley, Reading, MA, 1973b"},{"key":"10.1016\/S0169-023X(99)00017-8_BIB9","doi-asserted-by":"crossref","unstructured":"J.W. Miller, Random access from compressed data sets with perfect value hashing, Proceedings of 1995 IEEE International Symposium on Information Theory, BC, Canada, 1995, p. 454","DOI":"10.1109\/ISIT.1995.550441"},{"key":"10.1016\/S0169-023X(99)00017-8_BIB10","doi-asserted-by":"crossref","unstructured":"M. Nagao, Data compression of chinese pattern, Proceedings of the IEEE 68 (1980) 818\u2013829","DOI":"10.1109\/PROC.1980.11748"},{"key":"10.1016\/S0169-023X(99)00017-8_BIB11","doi-asserted-by":"crossref","unstructured":"A. Siegel, On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications, Proceedings of IEEE 36th Annual Foundations of Computer Science, NC, USA, 1989, pp. 20\u201325","DOI":"10.1109\/SFCS.1989.63450"},{"issue":"21","key":"10.1016\/S0169-023X(99)00017-8_BIB12","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1145\/359168.359175","article-title":"Sorting a sparse table","volume":"22","author":"Tarjan","year":"1979","journal-title":"Communications of the ACM"},{"issue":"2","key":"10.1016\/S0169-023X(99)00017-8_BIB13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0031-3203(94)00092-Z","article-title":"Application of hidden Markov models for signature verification","volume":"28","author":"Yang","year":"1995","journal-title":"Pattern Recognition"},{"issue":"3","key":"10.1016\/S0169-023X(99)00017-8_BIB14","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/322261.322274","article-title":"Should tables be stored","volume":"28","author":"Yao","year":"1981","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0169-023X(99)00017-8_BIB15","unstructured":"S.F. Ziegler, Small faster table driven parser, Madison Academic Computing Center, University of Wisconsin, Madison, Wisconsin, 1977"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X99000178?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X99000178?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T22:27:15Z","timestamp":1556144835000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X99000178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0169023X99000178"],"URL":"https:\/\/doi.org\/10.1016\/s0169-023x(99)00017-8","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}