String Processing and Information Retrieval, International Symposium on (1999)
Sept. 21, 1999 to Sept. 24, 1999
Ricardo Baeza-Yates , University de Chile
Walter Cunto , Universidad Sim?n Bol?var
Practical text proximity problems lead to the abstract data type Proximity that handles close points in the plane. Different variants and implementations of Proximity are proposed and tight-complexity bounds based on information theory are derived. This problem is related to evaluating Boolean queries in large text retrieval (as in Web search engines) and to the \Sorting X+Y" problem.
R. Baeza-Yates and W. Cunto, "The ADT Proximity and Text Proximity Problems," String Processing and Information Retrieval, International Symposium on(SPIRE), Cancun, Mexico, 1999, pp. 24.