Indexing high dimensional datasets has attracted extensive attention from many researchers in the last decade. Since R-tree type of index structures are known as suffering “curse...
Jiyuan An, Yi-Ping Phoebe Chen, Qinying Xu, Xiaofa...
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...
Uncertainty in categorical data is commonplace in many applications, including data cleaning, database integration, and biological annotation. In such domains, the correct value o...
Sarvjeet Singh, Chris Mayfield, Sunil Prabhakar, R...
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Aoy...
Sequential patterns of d-gaps exist pervasively in inverted lists of Web document collection indices due to the cluster property. In this paper the information of d-gap sequential...