We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction of all points in Q are of color c, mus...
The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructur...
Bin Wang, Xiaochun Yang, Guoren Wang, Lei Chen 000...
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Answer typing is commonly thought of as finding appropriate responses to given questions. We extend the notion of answer typing to information retrieval to ensure results contain...
Structured query language (SQL) is a classical way to access relational databases. Although SQL is powerful to query relational databases, it is rather hard for inexperienced user...
Guoliang Li, Ju Fan, Hao Wu, Jiannan Wang, Jianhua...