Matching query processing in high-dimensional space

TY - GEN

T1 - Matching query processing in high-dimensional space

AU - Ma, Chunyang

AU - Zhou, Yongluan

AU - Shou, Lidan

AU - Dai, Dan

AU - Chen, Gang

N1 - Conference code: 20

PY - 2011

Y1 - 2011

N2 - In many applications, such as online dating or job hunting websites, users often need to search for potential matches based on the requirements or preferences imposed by both sides.We refer to this type of queries as matching queries. In spite of their wide applicabilities, there has been little attention devoted to improve their performance. As matching queries often appear in various forms even within a single application, we, in this paper, propose a general processing framework, which can efficiently process various forms of matching queries. Moreover, we elaborate the detailed processing algorithms for two particular forms of matching queries to illustrate the applicability of this framework. We conduct an extensive experimental study with both synthetic and real datasets. The results indicate that, for various matching queries, our techniques can dramatically improve the query performance, especially when the dimensionality is high.

AB - In many applications, such as online dating or job hunting websites, users often need to search for potential matches based on the requirements or preferences imposed by both sides.We refer to this type of queries as matching queries. In spite of their wide applicabilities, there has been little attention devoted to improve their performance. As matching queries often appear in various forms even within a single application, we, in this paper, propose a general processing framework, which can efficiently process various forms of matching queries. Moreover, we elaborate the detailed processing algorithms for two particular forms of matching queries to illustrate the applicability of this framework. We conduct an extensive experimental study with both synthetic and real datasets. The results indicate that, for various matching queries, our techniques can dramatically improve the query performance, especially when the dimensionality is high.

U2 - 10.1145/2063576.2063806

DO - 10.1145/2063576.2063806

M3 - Article in proceedings

SP - 1589

EP - 1594

BT - Proceedings of the 20th ACM International Conference on Information and Knowledge Management

PB - Association for Computing Machinery

T2 - 20th ACM International Conference on Information and Knowledge Management

Y2 - 24 October 2011 through 28 October 2011

ER -