Minimal-interval semantics [3] associates with each query over a document a set of intervals, called witnesses, that are incomparable with respect to inclusion (i.e., they form an antichain): witnesses define the minimal regions of the document satisfying the query. Minimalinterval semantics makes it easy to define and compute several sophisticated proximity operators, provides snippets for user presentation, and can be used to rank documents: thus, computing efficiently the antichains obtained by operations such as logic conjunction and disjunction is a basic issue. In this paper we provide the first algorithms for computing such operators that are linear in the number of intervals and logarithmic in the number of input antichains. The space used is linear in the number of antichains. Moreover, the algorithms are lazy - they do not assume random access to the input antichains. These properties make the usage of our algorithms feasible in large-scale web search engines. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Boldi, P., & Vigna, S. (2006). Efficient lazy algorithms for minimal-interval semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4209 LNCS, pp. 134–149). Springer Verlag. https://doi.org/10.1007/11880561_12
Mendeley helps you to discover research relevant for your work.