Sciweavers

132 search results - page 4 / 27
» Preference query evaluation over expensive attributes
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
ICEIS
2009
IEEE
14 years 2 months ago
Relaxing XML Preference Queries for Cooperative Retrieval
Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been ...
SungRan Cho, Wolf-Tilo Balke
SSDBM
2008
IEEE
177views Database» more  SSDBM 2008»
14 years 1 months ago
Prioritized Evaluation of Continuous Moving Queries over Streaming Locations
Abstract. Existing approaches to the management of streaming positional updates generally assume that all active user requests have equal importance, ignoring the possibility of an...
Kostas Patroumpas, Timos K. Sellis
DMSN
2005
ACM
13 years 9 months ago
The threshold join algorithm for top-k queries in distributed sensor networks
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query...
Demetrios Zeinalipour-Yazti, Zografoula Vagena, Di...
ER
2006
Springer
137views Database» more  ER 2006»
13 years 11 months ago
Preference Functional Dependencies for Managing Choices
Abstract. The notion of user preference in database modeling has recently received much attention in advanced applications, such as personalization of e-services, since it captures...
Wilfred Ng