191 search results - page 9 / 39 » XPath Query Evaluation: Improving Time and Space Efficiency |
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
EDBT
2009
ACM
14 years 9 days ago
2009
ACM
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
EDBT
1998
ACM
14 years 19 days ago
1998
ACM
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
ECIR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. In this paper, we propose a common phrase index as an efficient index structure to support phrase queries in a very large text database. Our structure is an extension of ...