A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
Incremental Data Mining Using Concurrent Online Refresh of Materialized Data Mining Views
[chapter]
2005
Lecture Notes in Computer Science
We show that the concurrent on-line refresh of a set of materialized data mining views is more efficient than the sequential refresh of individual views. ...
In this paper we present a novel approach to materialized data mining view refresh process. ...
To the best of our knowledge the idea of concurrent online refresh of a set of materialized data mining views has not been presented yet. ...
doi:10.1007/11546849_29
fatcat:i72raoykcjac5o2yibc2k4oy4i
Materialized Data Mining Views
[chapter]
2000
Lecture Notes in Computer Science
Materialized data mining views store selected patterns discovered in a portion of a database, and are used for query rewriting, which transforms a data mining query into a query accessing a materialized ...
In this paper we present the concept of materialized data mining views. ...
Of course, data presented by a materialized view may become invalid as the source data changes. One of the solutions minimizing effects of this problem is periodic refreshing of materialized views. ...
doi:10.1007/3-540-45372-5_7
fatcat:jnvt75l54vegnndkafzlludrfq
Materialized view selection and maintenance using multi-query optimization
2001
SIGMOD record
In this paper, we show how to find an efficient plan for the maintenance of a set of materialized views, by exploiting common subexpressions between different view maintenance expressions. ...
However, whereas the amount of data entering a warehouse and the number of materialized views are rapidly increasing, the time window available for maintaining materialized views is shrinking. ...
Our work addresses the problem of optimizing the maintenance of a set of materialized views. ...
doi:10.1145/376284.375703
fatcat:ciio3lczdrdzpnrrbo7xfkkicq
Materialized view selection and maintenance using multi-query optimization
2001
Proceedings of the 2001 ACM SIGMOD international conference on Management of data - SIGMOD '01
In this paper, we show how to find an efficient plan for the maintenance of a set of materialized views, by exploiting common subexpressions between different view maintenance expressions. ...
However, whereas the amount of data entering a warehouse and the number of materialized views are rapidly increasing, the time window available for maintaining materialized views is shrinking. ...
Our work addresses the problem of optimizing the maintenance of a set of materialized views. ...
doi:10.1145/375663.375703
dblp:conf/sigmod/MistryRSR01
fatcat:n7lzktbsnrd7lg3btenra4zo5m
Cardinality estimation using sample views with quality assurance
2007
Proceedings of the 2007 ACM SIGMOD international conference on Management of data - SIGMOD '07
In this paper, we propose a new, general cardinality estimation technique that combines random sampling and materialized view technology to produce accurate estimates even in these situations. ...
Accurate cardinality estimation is critically important to high-quality query optimization. ...
At optimization time, the optimizer performs view matching, constructs a substitute expression and decides whether or not to use a materialized view. Sample views are used only at optimization time. ...
doi:10.1145/1247480.1247502
dblp:conf/sigmod/LarsonLZZ07
fatcat:tu2niphiofbobckv7gw5uo7fyq
Assortment of Materialized View: A Comparative Survey in Data Warehouse Environment
2014
International Journal of Computer Applications
Data warehouse stores lots of data in the form of views, referred as materialized views which provide a base for decision support or OLAP queries. ...
One of the most important aspect in data warehousing is the selection of materialized views which minimizes the query response time and maintenance cost, given a limited storage space. ...
The purpose of the algorithm is to minimize the materialization cost by selecting an optimal set of materialized view constrained by actual space from candidate view subsets. ...
doi:10.5120/16803-6521
fatcat:uzol5cawl5ambpov6zlsys3t7q
Approximate Continuous Query Answering over Streams and Dynamic Linked Data Sets
[chapter]
2015
Lecture Notes in Computer Science
In this paper, we address the problem of optimizing the evaluation of these queries by leveraging local views on background data. ...
the local view based on user-defined Quality of Service constraints. ...
Having materialized the intermediate results in a local view, the continuous queries join the local view with the stream. ...
doi:10.1007/978-3-319-19890-3_20
fatcat:kzpddczf3vevnmsqgdgzgvaei4
Incremental maintenance of aggregate and outerjoin expressions
2006
Information Systems
Change table of a particular view is applied to the view using a special refresh operator. ...
change-tables) as well as action (in terms of parameters of the refresh operation) through the given view expression. ...
Consider a simple outerjoin view V = R f o J S. Let R be the set of deletions from R, and let S set = π Attrs(S),N um=Count( * ) (S). ...
doi:10.1016/j.is.2004.11.011
fatcat:sp4c5ymqcvak3aepbfdd32uube
An overview of data warehousing and OLAP technology
1997
SIGMOD record
Data warehousing and on-line analytical processing (OLAP) are essential elements of decision support, which has increasingly become a focus of the database industry. ...
This overview is based on a tutorial that the authors presented at ...
Given a set of materialized views M, a query Q, we can define a set of minimal generators M' for Q (i.e., smallest set of generators such that all other generators generate some member of M'). ...
doi:10.1145/248603.248616
fatcat:ssiegmooy5bujdawwxoseke2my
DBToaster: higher-order delta processing for dynamic, frequently fresh views
2014
The VLDB journal
The system supports tens of thousands of complete view refreshes a second for a wide range of queries. ...
In this paper, we present viewlet transforms, a recursive finite differencing technique applied to queries. The viewlet transform materializes a query and a set of its higher-order deltas as views. ...
Definition 1 The viewlet transform turns a query into a set of update triggers that together maintain the view of the query and a set of auxiliary views. ...
doi:10.1007/s00778-013-0348-4
fatcat:3jt2mch2lndplafurohzlwev3q
DBToaster: Higher-order Delta Processing for Dynamic, Frequently Fresh Views
[article]
2012
arXiv
pre-print
The system supports tens of thousands of complete view refreshes a second for a wide range of queries. ...
In this paper, we present viewlet transforms, a recursive finite differencing technique applied to queries. The viewlet transform materializes a query and a set of its higher-order deltas as views. ...
Definition 1 The viewlet transform turns a query into a set of update triggers that together maintain the view of the query and a set of auxiliary views. ...
arXiv:1207.0137v1
fatcat:ekkkpeckqndz5fuazshu46rotu
DBToaster
2012
Proceedings of the VLDB Endowment
The system supports tens of thousands of complete view refreshes a second for a wide range of queries. ...
In this paper, we present viewlet transforms, a recursive finite differencing technique applied to queries. The viewlet transform materializes a query and a set of its higher-order deltas as views. ...
Definition 1 The viewlet transform turns a query into a set of update triggers that together maintain the view of the query and a set of auxiliary views. ...
doi:10.14778/2336664.2336670
fatcat:454b6wt5xvfa7obrctibozz55a
Selection Of Materialized View Using Query Optimization In Database Management : An Efficient Methodology
2010
International Journal of Database Management Systems
Selecting Views to be materialized is one of the most important decisions in designing a warehouse. ...
This paper focus on the issues of materialized views in Data warehousing to enable efficient Information Management. ...
The Materialized View is like a cache i.e. a copy of data that can be accessed which is required for frequent set of queries. ...
doi:10.5121/ijdms.2010.2410
fatcat:mcuymhuy3rh43bimyaoucexzli
Hybrid storage engine for geospatial data using NoSQL and SQL paradigms
2021
Tecnología en Marcha
In addition, the type of geometry increases the update response time of a materialized view. ...
The design and implementation of services to handle geospatial data involves thinking about storage engine performance and optimization for the desired use. ...
executing the operation: "Refresh materialized view that contains a set of different geometries" (GeomCollection). ...
doi:10.18845/tm.v34i1.4822
fatcat:c24hzemwsfdttcb6mncjsoipmy
Supporting Predicate-Window Queries in Data Stream Management Systems
2006
22nd International Conference on Data Engineering Workshops (ICDEW'06)
The window query model is widely used in data stream management systems where the focus of a continuous query is limited to a set of the most recent tuples. ...
., query execution and query optimization). ...
Any modification in ℜ(S) is propagated to produce the corresponding set of modifications in the query answer in a way similar to incremental maintenance of materialized views [13] . ...
doi:10.1109/icdew.2006.140
dblp:conf/icde/Ghanem06
fatcat:2zlfh3utyfbvzokk447snzxxr4
« Previous
Showing results 1 — 15 out of 35,041 results