Fast algorithms for k-word proximity search

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E84-A, Issue 9, 2001, Pages 2311-2318

  Sadakane, Kunihiko ^a   Imai, Hiroshi ^b  

^a TOHOKU UNIVERSITY   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

Divide and conquer; Plane sweep; Proximity search; Text retrieval

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; HTML; INFORMATION RETRIEVAL SYSTEMS; SERVERS;

PROXIMITY SEARCH;

SEARCH ENGINES;

EID: 0035444415     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. Compressed inverted files with reduced decoding overheads
2. Efficient processing of proximity queries for large databases
3. The ADT proximity and text proximity problems
4. New indices for text: PAT trees and PAT arrays
5. Text data mining based on optimal pattern discovery - Towards a scalable data mining system for large text databases
6. Authoritative sources in a hyperlinked environment
7. An algorithm for string matching with a sequence of don't cares
8. Suffix arrays: A new method for on-line string searches
9. Plane sweeping algorithms for intersecting geometric figures
10. A vector space model for automatic indexing
11. Cut as a querying unit for WWW, netnews, and e-mail