메뉴 건너뛰기




Volumn 14, Issue 4, 1996, Pages 349-379

Self-Indexing Inverted Files for Fast Text Retrieval

Author keywords

E.4 Data : Coding and Information Theory data compaction and compression; H.3.1 Information Storage and Retrieval : Content Analysis and Indexing indexing methods; H.3.2 Information Storage and Retrieval : Information Storage file organization

Indexed keywords

BOOLEAN QUERIES; FULL TEXT RETRIEVAL; INDEX COMPRESSION; INVERTED FILE; QUERY PROCESSING; SELF INDEXING;

EID: 0030260359     PISSN: 10468188     EISSN: None     Source Type: Journal    
DOI: 10.1145/237496.237497     Document Type: Article
Times cited : (289)

References (35)
  • 2
    • 84989508880 scopus 로고
    • Model based concordance compression
    • J. A. Storer and M. Cohn, Eds. IEEE Computer Society Press, Los Alamitos, Calif.
    • BOOKSTEIN, A., KLEIN, S. T., AND RAITA, T. 1992. Model based concordance compression. In Proceedings of the IEEE Data Compression Conference, J. A. Storer and M. Cohn, Eds. IEEE Computer Society Press, Los Alamitos, Calif., 82-91.
    • (1992) Proceedings of the IEEE Data Compression Conference , pp. 82-91
    • Bookstein, A.1    Klein, S.T.2    Raita, T.3
  • 7
    • 0023847144 scopus 로고
    • Implementing ranking strategies using text signatures
    • CROFT, W. B. AND SAVINO, P. 1988. Implementing ranking strategies using text signatures. ACM Trans. Off. Inf. Syst. 6, 1 (Jan.), 42-62.
    • (1988) ACM Trans. Off. Inf. Syst. , vol.6 , Issue.1 JAN , pp. 42-62
    • Croft, W.B.1    Savino, P.2
  • 8
    • 0016486577 scopus 로고
    • Universal codeword sets and representations of the integers
    • ELIAS, P. 1975. Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory IT-21, 2 (Mar.), 194-203.
    • (1975) IEEE Trans. Inf. Theory , vol.IT-21 , Issue.2 MAR , pp. 194-203
    • Elias, P.1
  • 10
    • 0022036177 scopus 로고
    • Access methods for text
    • FALOUTSOS, C. 1985a. Access methods for text. ACM Comput. Surv. 17, 1, 49-74.
    • (1985) ACM Comput. Surv. , vol.17 , Issue.1 , pp. 49-74
    • Faloutsos, C.1
  • 12
    • 84976690119 scopus 로고
    • Signature files: An access method for documents and its analytical performance evaluation
    • FALOUTSOS, C. AND CHRISTODOULAKIS, S. 1984. Signature files: An access method for documents and its analytical performance evaluation. ACM Trans. Off. Inf. Syst. 2, 4 (Oct.), 267-288.
    • (1984) ACM Trans. Off. Inf. Syst. , vol.2 , Issue.4 OCT , pp. 267-288
    • Faloutsos, C.1    Christodoulakis, S.2
  • 14
    • 1542622527 scopus 로고
    • Novel compression of sparse bit-strings - Preliminary report
    • Combinatorial Algorithms on Words, A. Apostolico and Z. Galil, Eds. Springer-Verlag, Berlin
    • FRAENKEL, A. S. AND KLEIN, S. T. 1985. Novel compression of sparse bit-strings - Preliminary report. In Combinatorial Algorithms on Words, A. Apostolico and Z. Galil, Eds. NATO ASI Series F, vol. 12. Springer-Verlag, Berlin, 169-183.
    • (1985) NATO ASI Series F , vol.12 , pp. 169-183
    • Fraenkel, A.S.1    Klein, S.T.2
  • 15
    • 0016485796 scopus 로고
    • Optimal source codes for geometrically distributed integer alphabets
    • GALLAGER, R. G. AND VAN VOORHIS, D. C. 1975. Optimal source codes for geometrically distributed integer alphabets. IEEE Trans. Inf. Theory IT-21, 2 (Mar.), 228-230.
    • (1975) IEEE Trans. Inf. Theory , vol.IT-21 , Issue.2 MAR , pp. 228-230
    • Gallager, R.G.1    Van Voorhis, D.C.2
  • 16
    • 84930881609 scopus 로고
    • Run-length encodings
    • GOLOMB, S. W. 1966. Run-length encodings. IEEE Trans. Inf. Theory IT-12, 3 (July), 399-401.
    • (1966) IEEE Trans. Inf. Theory , vol.IT-12 , Issue.3 JULY , pp. 399-401
    • Golomb, S.W.1
  • 17
    • 1542727754 scopus 로고
    • (Washington, D.C., Nov.). National Institute of Standards Special Publication 500-207. NIST, Washington, D.C.
    • HARMAN, D. K., Ed. 1992a. Proceedings of TREC Text Retrieval Conference (Washington, D.C., Nov.). National Institute of Standards Special Publication 500-207. NIST, Washington, D.C.
    • (1992) Proceedings of TREC Text Retrieval Conference
    • Harman, D.K.1
  • 18
    • 0002393292 scopus 로고
    • Ranking algorithms
    • W. B. Frakes and R. Baeza-Yates, Eds. Prentice-Hall, Englewood Cliffs, N.J.
    • HARMAN, D. K. 1992b. Ranking algorithms. In Information Retrieval: Data Structures and Algorithms, W. B. Frakes and R. Baeza-Yates, Eds. Prentice-Hall, Englewood Cliffs, N.J., 363-392.
    • (1992) Information Retrieval: Data Structures and Algorithms , pp. 363-392
    • Harman, D.K.1
  • 19
    • 84989499828 scopus 로고
    • Retrieving records from a gigabyte of text on a mini-computer using statistical ranking
    • HARMAN, D. K. AND CANDELA, G. 1990. Retrieving records from a gigabyte of text on a mini-computer using statistical ranking. J. Am. Soc. Inf. Sci. 41, 8, 581-589.
    • (1990) J. Am. Soc. Inf. Sci. , vol.41 , Issue.8 , pp. 581-589
    • Harman, D.K.1    Candela, G.2
  • 20
    • 0008521852 scopus 로고
    • A simple algorithm for merging two disjoint linearly ordered sets
    • HWANG, F. K. AND LIN, S. 1972. A simple algorithm for merging two disjoint linearly ordered sets. SIAM J. Comput. 1, 1, 31-39.
    • (1972) SIAM J. Comput. , vol.1 , Issue.1 , pp. 31-39
    • Hwang, F.K.1    Lin, S.2
  • 21
    • 84989592176 scopus 로고
    • A signature file scheme based on multiple organizations for indexing very large text databases
    • KENT, A. J., SACKS-DAVIS, R., AND RAMAMOHANARAO, K. 1990. A signature file scheme based on multiple organizations for indexing very large text databases. J. Am. Soc. Inf. Sci. 41, 7, 508-534.
    • (1990) J. Am. Soc. Inf. Sci. , vol.41 , Issue.7 , pp. 508-534
    • Kent, A.J.1    Sacks-Davis, R.2    Ramamohanarao, K.3
  • 22
    • 0024690043 scopus 로고
    • Storing text retrieval systems on CD-ROM: Compression and encryption considerations
    • KLEIN, S. T., BOOKSTEIN, A., AND DEERWESTER, S. 1989. Storing text retrieval systems on CD-ROM: Compression and encryption considerations. ACM Trans. Inf. Syst. 7, 3 (July), 230-245.
    • (1989) ACM Trans. Inf. Syst. , vol.7 , Issue.3 JULY , pp. 230-245
    • Klein, S.T.1    Bookstein, A.2    Deerwester, S.3
  • 24
    • 0001794236 scopus 로고
    • Development of a stemming algorithm
    • LOVINS, J. B. 1968. Development of a stemming algorithm. Mech. Transl. Comput. 11, 1-2, 22-31.
    • (1968) Mech. Transl. Comput. , vol.11 , Issue.1-2 , pp. 22-31
    • Lovins, J.B.1
  • 25
    • 0042026526 scopus 로고
    • A document retrieval system based upon nearest neighbour searching
    • LUCARELLA, D. 1988. A document retrieval system based upon nearest neighbour searching. J. Inf. Sci. 14, 25-33.
    • (1988) J. Inf. Sci. , vol.14 , pp. 25-33
    • Lucarella, D.1
  • 26
    • 0017489510 scopus 로고
    • An inverted index implementation
    • MCDONELL, K. J. 1977. An inverted index implementation. Comput. J. 20, 1, 116-123.
    • (1977) Comput. J. , vol.20 , Issue.1 , pp. 116-123
    • Mcdonell, K.J.1
  • 30
    • 84976700871 scopus 로고
    • Multi-key access methods based on superimposed coding techniques
    • SACKS-DAVIS, R., KENT, A. J., AND RAMAMOHANARAO, K. 1987. Multi-key access methods based on superimposed coding techniques. ACM Trans. Database Syst. 12, 4 (Dec.), 655-696.
    • (1987) ACM Trans. Database Syst. , vol.12 , Issue.4 DEC , pp. 655-696
    • Sacks-Davis, R.1    Kent, A.J.2    Ramamohanarao, K.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.