12 Result(s)
within
Article
Ada Wai-Chee Fu
-
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
A Gracefully Degradable Declustered RAID Architecture
A new layout method Prime-groups is proposed to evenly distribute parity groups for declustered RAID. Prime-groups satisfies most of the layout goals for a good declustered RAID layout. For the goals that are ...
-
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
Data Mining for Inventory Item Selection with Cross-Selling Considerations
Association rule mining, studied for over ten years in the literature of data mining, aims to help enterprises with sophisticated decision making, but the resulting rules typically cannot be directly applied a...
-
Article
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to set a bound on the result siz...
-
Article
Clustering Text Data Streams
Clustering text data streams is an important issue in data mining community and has a number of applications such as news group filtering, text crawling, document organization and topic detection and tracing e...
-
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...
-
Article
Optimal location query based on k nearest neighbours
Optimal location query in road networks is a basic operation in the location intelligence applications. Given a set of clients and servers on a road network, the purpose of optimal location query is to obtain ...
