메뉴 건너뛰기




Volumn 6347 LNCS, Issue PART 2, 2010, Pages 194-205

Top-k ranked document search in general text databases

Author keywords

[No Author keywords available]

Indexed keywords

BREAK DOWN; DOCUMENT SEARCH; EXISTING METHOD; INVERTED FILES; NATURAL LANGUAGE TEXT; NEW APPROACHES; TEXT DATABASE; THEORETICAL TECHNIQUE;

EID: 78349268787     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15781-3_17     Document Type: Conference Paper
Times cited : (62)

References (24)
  • 1
    • 33750317853 scopus 로고    scopus 로고
    • Pruned query evaluation using pre-computed impacts
    • Anh, V., Moffat, A.: Pruned query evaluation using pre-computed impacts. In: Proc. 29th ACM SIGIR, pp. 372-379 (2006)
    • (2006) Proc. 29th ACM SIGIR , pp. 372-379
    • Anh, V.1    Moffat, A.2
  • 2
    • 0002139526 scopus 로고
    • The myriad virtues of subword trees
    • NATO ISI Series, Springer, Heidelberg
    • Apostolico, A.: The myriad virtues of subword trees. In: Combinatorial Algorithms on Words. NATO ISI Series, pp. 85-96. Springer, Heidelberg (1985)
    • (1985) Combinatorial Algorithms on Words , pp. 85-96
    • Apostolico, A.1
  • 4
    • 84896788505 scopus 로고    scopus 로고
    • The LCA problem revisited
    • Gonnet, G.H., Viola, A. (eds.) LATIN 2000 Springer, Heidelberg
    • Bender, M., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88-94. Springer, Heidelberg (2000)
    • (2000) LNCS , vol.1776 , pp. 88-94
    • Bender, M.1    Farach-Colton, M.2
  • 5
    • 34250171723 scopus 로고    scopus 로고
    • Compressed representations of sequences and full-text indexes
    • article 20
    • Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM TALG 3(2), article 20 (2007)
    • (2007) ACM TALG , vol.3 , Issue.2
    • Ferragina, P.1    Manzini, G.2    Mäkinen, V.3    Navarro, G.4
  • 6
    • 38049088202 scopus 로고    scopus 로고
    • A new succinct representation of RMQ-information and improvements in the enhanced suffix array
    • Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007 Springer, Heidelberg
    • Fischer, J., Heun, V.: A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 459-470. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4614 , pp. 459-470
    • Fischer, J.1    Heun, V.2
  • 7
    • 70350676798 scopus 로고    scopus 로고
    • Range quantile queries: Another virtue of wavelet trees
    • Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. Springer, Heidelberg
    • Gagie, T., Puglisi, S., Turpin, A.: Range quantile queries: Another virtue of wavelet trees. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 1-6. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5721 , pp. 1-6
    • Gagie, T.1    Puglisi, S.2    Turpin, A.3
  • 8
    • 0037739870 scopus 로고    scopus 로고
    • High-order entropy-compressed text indexes
    • Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th SODA, pp. 841-850 (2003)
    • (2003) Proc. 14th SODA , pp. 841-850
    • Grossi, R.1    Gupta, A.2    Vitter, J.3
  • 9
    • 77952349728 scopus 로고    scopus 로고
    • Space-efficient framework for top-k string retrieval problems
    • Hon, W.-K., Shah, R., Vitter, J.S.: Space-efficient framework for top-k string retrieval problems. In: Proc. FOCS, pp. 713-722 (2009)
    • (2009) Proc. FOCS , pp. 713-722
    • Hon, W.-K.1    Shah, R.2    Vitter, J.S.3
  • 10
    • 0027681165 scopus 로고
    • Suffix arrays: A new method for on-line string searches
    • Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Computing 22(5), 935-948 (1993)
    • (1993) SIAM J. Computing , vol.22 , Issue.5 , pp. 935-948
    • Manber, U.1    Myers, G.2
  • 11
    • 0037967496 scopus 로고    scopus 로고
    • An analysis of the Burrows-Wheeler transform
    • Manzini, G.: An analysis of the Burrows-Wheeler transform. J. ACM 48(3), 407-430 (2001)
    • (2001) J. ACM , vol.48 , Issue.3 , pp. 407-430
    • Manzini, G.1
  • 12
    • 33744962566 scopus 로고    scopus 로고
    • Efficient algorithms for document retrieval problems
    • Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Proc. 13th SODA, pp. 657-666 (2002)
    • (2002) Proc. 13th SODA , pp. 657-666
    • Muthukrishnan, S.1
  • 13
    • 34147186297 scopus 로고    scopus 로고
    • Compressed full-text indexes
    • article 2
    • Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys 39(1), article 2 (2007)
    • (2007) ACM Computing Surveys , vol.39 , Issue.1
    • Navarro, G.1    Mäkinen, V.2
  • 14
    • 0030270397 scopus 로고    scopus 로고
    • Filtered document retrieval with frequency-sorted indexes
    • Persin, M., Zobel, J., Sacks-Davis, R.: Filtered document retrieval with frequency-sorted indexes. JASIS 47(10), 749-764 (1996)
    • (1996) JASIS , vol.47 , Issue.10 , pp. 749-764
    • Persin, M.1    Zobel, J.2    Sacks-Davis, R.3
  • 15
    • 0032268440 scopus 로고    scopus 로고
    • A language modeling approach to information retrieval
    • Ponte, J.M., Croft, W.B.: A language modeling approach to information retrieval. In: Proc. 21th ACM SIGIR, pp. 275-281 (1998)
    • (1998) Proc. 21th ACM SIGIR , pp. 275-281
    • Ponte, J.M.1    Croft, W.B.2
  • 16
    • 33750306791 scopus 로고    scopus 로고
    • Inverted files versus suffix arrays for locating patterns in primary memory
    • Crestani, F., Ferragina, P., Sanderson, M. (eds.) SPIRE 2006. Springer, Heidelberg
    • Puglisi, S., Smyth, W., Turpin, A.: Inverted files versus suffix arrays for locating patterns in primary memory. In: Crestani, F., Ferragina, P., Sanderson, M. (eds.) SPIRE 2006. LNCS, vol. 4209, pp. 122-133. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.4209 , pp. 122-133
    • Puglisi, S.1    Smyth, W.2    Turpin, A.3
  • 17
    • 1842488082 scopus 로고    scopus 로고
    • Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
    • Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. SODA, pp. 233-242 (2002)
    • (2002) Proc. SODA , pp. 233-242
    • Raman, R.1    Raman, V.2    Rao, S.3
  • 18
    • 0016958419 scopus 로고
    • Relevance weighting of search terms
    • Robertson, S.E., Jones, K.S.: Relevance weighting of search terms. JASIST 27, 129-146 (1976)
    • (1976) JASIST , vol.27 , pp. 129-146
    • Robertson, S.E.1    Jones, K.S.2
  • 20
    • 33947647477 scopus 로고    scopus 로고
    • Succinct data structures for flexible text retrieval systems
    • Sadakane, K.: Succinct data structures for flexible text retrieval systems. J. Discrete Algorithms 5(1), 12-22 (2007)
    • (2007) J. Discrete Algorithms , vol.5 , Issue.1 , pp. 12-22
    • Sadakane, K.1
  • 21
    • 0016572913 scopus 로고
    • A vector space model for automatic indexing
    • Salton, G., Wong, A., Yang, C.S.: A vector space model for automatic indexing. Comm. ACM 18(11), 613-620 (1975)
    • (1975) Comm. ACM , vol.18 , Issue.11 , pp. 613-620
    • Salton, G.1    Wong, A.2    Yang, C.S.3
  • 22
    • 37849047274 scopus 로고    scopus 로고
    • Space-efficient algorithms for document retrieval
    • Ma, B., Zhang, K. (eds.) CPM 2007 Springer, Heidelberg
    • Välimäki, N., Mäkinen, V.: Space-efficient algorithms for document retrieval. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 205-215. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4580 , pp. 205-215
    • Välimäki, N.1    Mäkinen, V.2
  • 24
    • 33747729581 scopus 로고    scopus 로고
    • Inverted files for text search engines
    • Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Computing Surveys 38(2), 1-56 (2006)
    • (2006) ACM Computing Surveys , vol.38 , Issue.2 , pp. 1-56
    • Zobel, J.1    Moffat, A.2


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