Efficient lazy algorithms for minimal-interval semantics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4209 LNCS, Issue , 2006, Pages 134-149

  Boldi, Paolo ^a   Vigna, Sebastiano ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MATHEMATICAL OPERATORS; QUERY LANGUAGES; SEARCH ENGINES; USER INTERFACES;

MINIMALINTERVAL SEMANTICS; PROXIMITY OPERATORS;

SEMANTICS;

EID: 33750309637     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11880561_12     Document Type: Conference Paper

References (13)

1. Garrett Birkhoff. Lattice Theory, volume XXV of AMS Colloquium Publications, American Mathematical Society, third (new) edition, 1970.
2. Charles L. A. Clarke and Gordon V. Cormack. Shortest-substring retrieval and ranking. ACM Trans. Inf. Syst, 18(1):44-78, 2000.
3. Charles L. A. Clarke, Gordon V. Cormack, and Forbes J. Burkowski. An algebra for structured text search and a framework for its implementation. Comput. J., 38(1):43-56, 1995.
4. J. Crampton and G. Loizou. The completion of a poset in a lattice of antichains, International Mathematical Journal, 1(3):223-238, 2001.
5. G. H. Gonnet. PAT 3.1: An efficient text searching system. User's manual. Technical report, Center for the New Oxford English Dictionary. University of Waterloo, Waterloo, Canada, 1987.
6. Jani Jaakkola and Pekka Kilpeläinen. Nested text-region algebra. Technical Report C-1999-2, Department of Computer Science, University of Helsinki, 1999.
7. Guy-Vincent Jourdan, Jean-Xavier Rampon, and Claude Jard. Computing on-line the lattice of maximal antichains of posets. Order, 11(3):197-210, 1994.
8. Gonzalo Navarro and Ricardo Baeza-Yates. A class of linear algorithms to process sets of segments. In Proc. CLEI'96, volume 2, pages 671-682, 1996.
9. Jürg Nievergelt and Franco P. Preparata. Plane-sweep algorithms for intersecting geometric figures. Comm. ACM, 25(10):739-747, 1982.
10. The Lemur Project. Indri. http://www.lemurproject.org/indri/.
11. Kunihiko Sadakane and Hiroshi Imai. Fast algorithms for k-word proximity search. IEICE Trans. Fundamentals, E84-A(9), September 2001.
12. Ian H. Witten, Alistair Moffat, and Timothy C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, Los Altos, CA 94022, USA, second edition, 1999.
13. Matthew Young-Lai and Frank Wm. Tompa. One-pass evaluation of region algebra expressions. Inf. Syst., 28(3):159-168, 2003.