Upcoming Courses

go to course
Quality Web Communication: The Beginner's Guide
Starts tomorrow LAST CALL!
go to course
UI Design Patterns for Successful Software
90% booked. Starts in 5 days

Featured chapter

Marc Hassenzahl explains the fascinating concept of User Experience and Experience Design. Commentaries by Don Norman, Eric Reiss, Mark Blythe, and Whitney Hess

User Experience and Experience Design !


Our Latest Books

The Social Design of Technical Systems: Building technologies for communities. 2nd Edition
by Brian Whitworth and Adnan Ahmad
start reading
Gamification at Work: Designing Engaging Business Software
by Janaki Mythily Kumar and Mario Herger
start reading
The Social Design of Technical Systems: Building technologies for communities
by Brian Whitworth and Adnan Ahmad
start reading
The Encyclopedia of Human-Computer Interaction, 2nd Ed.
by Mads Soegaard and Rikke Friis Dam
start reading

Qiang Xue


Publications by Qiang Xue (bibliography)

 what's this?
Edit | Del

Qian, Gang, Zhu, Qiang, Xue, Qiang and Pramanik, Sakti (2006): A space-partitioning-based indexing method for multidimensional non-ordered discrete data spaces. In ACM Transactions on Information Systems, 24 (1) pp. 79-110. http://doi.acm.org/10.1145/1125857.1125860

There is an increasing demand for similarity searches in a multidimensional non-ordered discrete data space (NDDS) from application areas such as bioinformatics and data mining. The non-ordered and discrete nature of an NDDS raises new challenges for developing efficient indexing methods for similarity searches. In this article, we propose a new indexing technique, called the NSP-tree, to support efficient similarity searches in an NDDS. As we know, overlap causes a performance degradation for indexing methods (e.g., the R-tree) for a continuous data space. In an NDDS, this problem is even worse due to the limited number of elements available on each dimension of an NDDS. The key idea of the NSP-tree is to use a novel discrete space-partitioning (SP) scheme to ensure no overlap at each level in the tree. A number of heuristics and strategies are incorporated into the tree construction algorithms to deal with the challenges for developing an SP-based index tree for an NDDS. Our experiments demonstrate that the NSP-tree is quite promising in supporting efficient similarity searches in NDDSs. We have compared the NSP-tree with the ND-tree, a data-partitioning-based indexing technique for NDDSs that was proposed recently, and the linear scan using different NDDSs. It was found that the search performance of the NSP-tree was better than those of both methods.

© All rights reserved Qian et al. and/or ACM Press

Edit | Del

Xue, Qiang, Pramanik, Sakti, Qian, Gang and Zhu, Qiang (2005): The Hybrid Digital Tree: A New Indexing Technique for Large String Databases. In: Chen, Chin-Sheng, Filipe, Joaquim, Seruca, Isabel and Cordeiro, Jos (eds.) ICEIS 2005 - Proceedings of the Seventh International Conference on Enterprise Information Systems May 25-28, 2005, Miami, USA. pp. 115-121.

Add publication
Show list on your website

Join our community and advance:




Join our community!

Page Information

Page maintainer: The Editorial Team
URL: http://www.interaction-design.org/references/authors/qiang_xue.html