information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. the document processor, matching function and query analyzer are the main components of an information retrieval system. document retrieval system is fundamentally based on: boolean, vector-space, probabilistic, and language models. in this paper, a new methodology for mat...

We present the Skip lifts, a randomized dictionary data structure inspired from the skip list [Pugh ’90, Comm. of the ACM]. Similarly to the skip list, the skip lifts has the finger search property: Given a pointer to an arbitrary element f , searching for an element x takes expected O(log δ) time where δ is the rank distance between the elements x and f . The skip lifts uses nodes of O(1) wors...

Graphs are a generalized concept that encompasses more complex data structures than trees, such as difference lists, doubly-linked skip and leaf-linked trees. Normally, these handled with destructive assignments to heaps, which is opposed purely functional programming style makes verification difficult. We propose new language, λGT, handles graphs immutable, first-class pattern matching mechani...

Although there are a lot of optimized concurrent algorithms for lists, queues, stacks, hash tables and other common data structures, there are much fewer optimized concurrent Binary Search Trees implementations. This paper compares several concurrent implementations of Binary Search Tree. The implementations are also compared to a concurrent skip list, which is the general way to implement a co...

In this paper we will discuss advanced search functions for multimedia data produced by presentation. Such multimedia data consist of video of the speaker and slides used for explanation. In conventional systems, during playback these two components are synchronized and the presentation is played like video tape recorder. Basic functions are play, fast-play, skip, rewind and go-to-the previous-...

Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...

Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...

We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.