![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances
-
Article
Diamond Quorum Consensus for High Capacity and Efficiency in a Replicated Database System
Many quorum consensus protocols have been proposed for the management of replicated data in a distributed environment. The advantages of a replicated database system over a non-replicated one include high avai...
-
Article
Optimal Algorithms for Finding User Access Sessions from Very Large Web Logs
Although efficient identification of user access sessions from very large web logs is an unavoidable data preparation task for the success of higher level web log mining, little attention has been paid to algo...
-
Article
Scaling and time war** in time series querying
The last few years have seen an increasing understanding that dynamic time war** (DTW), a technique that allows local flexibility in aligning time series, is superior to the ubiquitous Euclidean distance for...
-
Article
Fast graph query processing with a low-cost index
This paper studies the problem of processing supergraph queries, that is, given a database containing a set of graphs, find all the graphs in the database of which the query graph is a supergraph. Existing works ...
-
Article
Maximizing bichromatic reverse nearest neighbor for L p -norm in two- and three-dimensional spaces
Bichromatic reverse nearest neighbor (BRNN) has been extensively studied in spatial database literature. In this paper, we study a related problem called MaxBRNN: find an optimal region that maximizes the size...
-
Article
STAIRS: Towards efficient full-text filtering and dissemination in DHT environments
Nowadays “live” content, such as weblog, wikipedia, and news, is ubiquitous in the Internet. Providing users with relevant content in a timely manner becomes a challenging problem. Differing from Web search te...