Sciweavers

785 search results - page 87 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
ICIP
2001
IEEE
14 years 10 months ago
Color image coding, indexing and retrieval using binary space partitioning tree
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
Guoping Qiu, S. Sudirman
ICDE
2008
IEEE
129views Database» more  ICDE 2008»
14 years 10 months ago
Hierarchical Indexing Approach to Support XPath Queries
We study new hierarchical indexing approach to process XPATH queries. Here, a hierarchical index consists of index entries that are pairs of queries and their (full/partial) answer...
Jeffrey Xu Yu, Kam-Fai Wong, M. Tamer Özsu, N...
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 9 months ago
Efficient k-NN search on vertically decomposed data
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...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
DNIS
2010
Springer
240views Database» more  DNIS 2010»
14 years 8 days ago
AccKW: An Efficient Access Control Scheme for Keyword-Based Search over RDBMS
Access control for relational databases is a well researched area. An SQL query is allowed or denied access to database according to the specified access control policy. On the oth...
Vikram Goyal, Ashish Sureka, Sangeeta Lal
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 10 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura