This article reviews index structures for fast similarity search for objects represented by
binary vectors (with components equal to 0 or 1). Structures for both exact and approximate …

The problem of c-Approximate Nearest Neighbor (c-ANN) search in high-dimensional space
is fundamentally important in many applications, such as image database and data mining …

In the big data era, the efficient indexing of gradually increasing databases is becoming
vitally important for information retrieval. To incrementally adapt to changes of databases, in …

Similarity search is the task of retrieving data items that are similar to a given query. In this
paper, we introduce the time-sensitive notion of similarity search over endless data-streams …

Cloud computing needs to process and analyze massive high-dimensional data in a real-
time manner. Approximate queries in cloud computing systems can provide timely queried …

In this paper, we introduce the Meeting Point based of Trip Plans (MPTPs) queries. Given a
set of source locations for a group of friends, and a set of trip plans for each group member …

Motif mining became more popular and got more attention towards data mining field due to
its real world applications such as health prediction, locating previous patterns in time series …

The explosive growth in Big Data in the last years, has attracted much attention in designing
efficient indexing and searching methods. In many critical applications such as large scale …

Trip planning queries are considered an important part of Location Based Services. As the
first part of our research, we investigated Sequenced Group Trip PLanning Queries (SGTP) …

Most current database management systems are optimized for single query execution. Yet,
often, queries come as part of a query workload. Therefore, there is a need for index …