• Publications
  • Influence
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
TLDR
An efficient B+-tree based indexing method for K-nearest neighbor (KNN) search in a high-dimensional metric space, called iDistance, which partitions the data based on a space- or data-partitioning strategy, and selects a reference point for each partition. Expand
Efficient Progressive Skyline Computation
TLDR
This paper presents two novel algorithms, Bitmap and Index, to compute the skyline of a set of points, and shows that the proposed algorithms provide quick initial response time with Index being superior in most cases. Expand
BLOCKBENCH: A Framework for Analyzing Private Blockchains
TLDR
BLOCKBENCH is described, the first evaluation framework for analyzing private blockchains and it serves as a fair means of comparison for different platforms and enables deeper understanding of different system design choices, and is released for public use. Expand
BATON: A Balanced Tree Structure for Peer-to-Peer Networks
TLDR
It is shown that sideways routing tables maintained at each node provide sufficient fault tolerance to permit efficient repair and an experimental assessment validates the practicality of the proposed balanced tree structure overlay on a peer-to-peer network. Expand
EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data
TLDR
An extended inverted index is proposed to facilitate keyword-based search, and a novel ranking mechanism for enhancing search effectiveness is presented, which achieves both high search efficiency and high accuracy. Expand
Query and Update Efficient B+-Tree Based Indexing of Moving Objects
TLDR
This work represents moving-object locations as vectors that are timestamped based on their update time and shows that it is capable of substantially outperforming the R-tree based TPR-tree for both single and concurrent access scenarios. Expand
CDAS: A Crowdsourcing Data Analytics System
TLDR
A quality-sensitive answering model is introduced, which guides the crowdsourcing query engine for the design and processing of the corresponding crowdsourcing jobs, and effectively reduces the processing cost while maintaining the required query answer quality. Expand
Collective spatial keyword querying
TLDR
This paper defines the problem of retrieving a group of spatial web objects such that the group's keywords cover the query's keywords and such that objects are nearest to the query location and have the lowest inter-object distances and designs exact and approximate solutions with provable approximation bounds to the problems. Expand
Efficient Processing of k Nearest Neighbor Joins using MapReduce
TLDR
This paper investigates how to perform kNN join using MapReduce which is a well-accepted framework for data-intensive applications over clusters of computers and designs an effective mapping mechanism that exploits pruning rules for distance filtering, and hence reduces both the shuffling and computational costs. Expand
Untangling Blockchain: A Data Processing View of Blockchain Systems
TLDR
This paper conducts a comprehensive evaluation of three major blockchain systems based on BLOCKBENCH, namely Ethereum, Parity, and Hyperledger Fabric, and discusses several research directions for bringing blockchain performance closer to the realm of databases. Expand
...
1
2
3
4
5
...