Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
Maxim Kormilitsin, Rada Chirkova, Yahya Fathi, Mat...
: Data collection of covert networks is an inherently difficult task because of the very nature of these networks. Researchers find it difficult to locate and access data relating ...
Nasrullah Memon, Uffe Kock Wiil, Reda Alhajj, Clau...
Web-database systems are nowadays an integral part of everybody's life, with applications ranging from monitoring/trading stock portfolios, to personalized blog aggregation a...
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...