Maintenance of top-k materialized views
Explore this paper's citation graph
Summary
A principled method is provided that complements the inefficiency of the state of the art independently of the statistical properties of the data and the characteristics of the update streams and provides theoretical guarantees for the nucleation of a view with respect to another view and the reflection of this property to the management of updates.
- Type
- article
- Published
- 2010-04-01
- Cited by
- 6
- References
- 22
- OpenAlex
- https://openalex.org/W2149053721
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:14692985
Keywords
Materialized view, Computer science, Structuring, Inefficiency, Relation (database)
References
- Tuning the top-k view update process
- Dynamic Query Evaluation Plans: Some Course Corrections?
- Efficient top-k processing in large-scaled distributed environments
- Probability and Statistics with Reliability, Queuing, and Computer Science Applications
- Dynamic query evaluation plans
- Combining fuzzy information from multiple systems (extended abstract)
- Combining Fuzzy Information from Multiple Systems
- Query processing issues in image (multimedia) databases
- Fuzzy queries in multimedia database systems
- Continuous monitoring of top-k queries over sliding windows
- The state of the art in distributed query processing
- Progressive skyline computation in database systems
- Algorithms and applications for answering ranked queries using ranked views
- Efficient maintenance of materialized top-k views
- Optimal aggregation algorithms for middleware
- Answering top-k queries using views
- Optimizing Multi-Feature Queries for Image Databases
- Evaluating top-k queries over Web-accessible databases
- On efficient top-k query processing in highly distributed environments
- PREFER: a system for the efficient execution of multi-parametric ranked queries
Cited by
- Building and Maintaining Halls of Fame over a Database
- Efficient Continual Top-k Keyword Search in Relational Databases
- Efficient top-k retrieval for user preference queries
- Interesting event detection through hall of fame rankings
- Threshold-Based Distributed Continuous Top-k Query Processing for Minimizing Communication Overhead
- Subscription-based data aggregation techniques for top-k monitoring queries