The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
DB2 Spatial Extender - Spatial data within the RDBMS
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient evaluation of partially-dimensional range queries using adaptive r*-tree
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
KANSEI-Based image retrieval associated with color
WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications
Hi-index | 0.00 |
All of the information retrieval (IR) systems try to retrieve the information that users really want. For this purpose, users have to exactly express and submit their requirements to the systems. However, how to reflect user's subjectivities is a hard problem. When a user wants to search for something, for instance a passenger car or a costume, he/she normally has a kind of feeling such as "graceful and looks intelligent, but not so expensive." Many researchers call this feeling as "Kansei" in many researches, which means the user's psychological feeling as well as the physiological issues. Let's see another example. Image retrieval systems having an ability to handle subjective expressions are useful especially when the users, who have no knowledge about contents of the image database, try to use some Kansei words (e.g., " beautiful", "calm", etc.) to retrieve unknown images. Unfortunately, traditional information retrieval systems cannot efficiently deal with the user-given search requests with Kansei words. Thus, in many application systems, how to deal with Kansei words from different users has become an important issue that the system designers have to confront. In this background, "Kansei engineering" has become one of the hot topics in IR field. In addition, many Kansei retrieval systems have been implemented. However, all of the existing Kansei retrieval systems aim at specific applications. Thus, they are very different from each other. In this paper, based on the many investigations and analysis on the existing systems, we propose a general method for designing efficient Kansei retrieval systems, which has not been done in this field. Our proposal mainly includes a general flow for designing Kansei retrieval systems and a discussion on how to speed up the Kansei retrieval processes using multidimensional indexes. We hope that this paper will be able to help the designers who are planning to design Kansei retrieval systems.