In this survey we overview the definitions and methods for graph clustering, that is, finding
sets of “related” vertices in graphs. We review the many definitions for what is a cluster in a …

In this paper we present an n^ O (k 1-1/d)-time algorithm for solving the k-center problem
in\reals d, under L∈ fty-and L 2-metrics. The algorithm extends to other metrics, and to the …

Queries navigate semistructured data via path expressions, and can be accelerated using
an index. Our solution encodes paths as strings, and inserts those strings into a special …

Grace is a graph-aware, in-memory, transactional graph management system, specifically
built for real-time queries and fast iterative computations. It is designed to run on large multi …

Emerging database applications require the use of new indexing structures beyond B-trees
and R-trees. Examples are the kD tree, the trie, the quadtree, and their variants. They are …

Clustering is an unsupervised learning task that models data as coherent groups. Multiple
approaches have been proposed in the past to cluster large volumes of data. Graphs …

In this paper, we examine the complexity of multi-dimensional range searching in non-
replicating index structures. Such nonreplicating structures achieve low storage costs and …

We consider the problem of creating a sample view of a database table. A sample view is an
indexed materialized view that permits efficient sampling from an arbitrary range query over …

The emergence of extensible index structures, eg, GiST (generalized search tree)[JM
Hellerstein et al.(1995)] and SP-GiST (space-partitioning generalized search tree)[W. G Aref …

Many evolving database applications warrant the use of non-traditional indexing
mechanisms beyond B+-trees and hash tables. SP-GiST is an extensible indexing …