类 型
44 篇文献
 
Efficient top-k processing in large-scaled distributed environments  
The rapid development of networking technologies has made it possible to construct a distributed database that involves a huge number of sites. Query processing in such a large-scaled system poses ser......
Data and Knowledge Engineering  2007
5次引用 0 0
Materialized Top-k Views  
We tackle the problem of maintaining materialized top-k views in this paper. Top-k queries, including MIN and MAX as important special cases, occur frequently in common database workloads. A top-k vie......
0次引用 0 0
Processing Top-N Relational Queries by Learning ∗  
Abstract. A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method for evalua......
0次引用 0 0
Efficient Maintenance of Materialized Top-k Views  
We tackle the problem of maintaining materialized top-k views. Top-k queries, including MIN and MAX as important special cases, occur frequently in common database workloads. A top-k view can be mater......
International Conference on Data Engineering  2003
44次引用 0 0
Reverse Top-k Queries  
Abstract— Rank-aware query processing has become essential for many,applications that return to the user only the top-k objects based on the individual user’s preferences. Top-k queries have been main......
International Conference on Data Engineering  
2次引用 0 0
Maintenance of top-k materialized views  
In this paper we present results on the problem of maintaining materialized top-k views and provide results in two directions. The first problem we tackle concerns the maintenance of top-k views in th......
Distributed and Parallel Databases  2010
0次引用 0 0
SAO: A Stream Index for Answering Linear Optimization Queries  
Linear optimization queries retrieve the top-K tuples in a sliding window of a data stream that maximize/minimize the linearly weighted sums of certain attribute values. To efficiently answer such que......
International Conference on Data Engineering  2007
2次引用 0 0
Processing top-  
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method for evaluating top-N......
Journal of Intelligent Information Systems  2010
0次引用 0 0
Feeding frenzy: selectively materializing users' event feeds  
Near real-time event streams are becoming a key feature of many popular web applications. Many web sites allow users to create a personalizedfeedby selecting one or more event streams they wish tofoll......
International Conference on Management of Data  2010
15次引用 0 0
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 addressed research topic in......
International Conference on Information and Knowledge Management  2009
10次引用 0 0

1/5 第一页 上一页 1 2 3 4 5 下一页
Feedback
Feedback
Feedback
我想反馈:
排行榜