Developing a Dynamic Materialized View Index for Efficiently Discovering Usable Views for Progressive Queries

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Journal of Information Processing Systems

• Publication date

  2013-08-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.3745/jips.2013.9.4.511
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Optimization of Monotonic Linear Progressive Queries Based on Dynamic Materialized Views

  2014cited by this paper
• DMVI: a dynamic materialized view index for efficiently discovering usable views for progressive queries

  2012cited by this paper
• Efficient Iceberg Query Evaluation Using Compressed Bitmap Index

  2012cited by this paper
• Real-time creation of bitmap indexes on streaming network data

  2011cited by this paper
• BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space

  2011cited by this paper
• Deferred Maintenance of Indexes and of Materialized Views

  2011cited by this paper
• A materialized-view based technique to optimize progressive queries via dependency analysis

  2011cited by this paper
• CORADD

  2010cited by this paper
• Analyses of multi-level and multi-component compressed bitmap indexes

  2010cited by this paper
• Bed-tree: an all-purpose index structure for string similarity search based on edit distance

  2010cited by this paper
• Efficient processing of monotonic linear progressive queries via dynamic materialized views

  2010cited by this paper
• Answering Keyword Queries on XML Using Materialized Views

  2008cited by this paper
• Adaptive Bitmap Indexes for Space-Constrained Systems

  2008cited by this paper
• Exact and inexact methods for selecting views and indexes for OLAP performance improvement

  2008cited by this paper
• The Collective Index: A Technique for Efficient Processing of Progressive Queries

  2008cited by this paper
• Multi-resolution bitmap indexes for scientific data

  2007cited by this paper
• Data mining-based materialized view and index selection in data warehouses

  2007cited by this paper
• Closure-Tree: An Index Structure for Graph Queries

  2006cited by this paper
• Presto authorization: a bitmap indexing scheme for high-speed access control to XML documents

  2006cited by this paper
• Query evaluation using overlapping views: completeness and efficiency

  2006cited by this paper
• On the sequencing of tree structures for XML indexing

  2005cited by this paper
• Rewriting XPath Queries Using Materialized Views

  2005cited by this paper
• View matching for outer-join views

  2005cited by this paper
• View-Based Query Processing: On the Relationship Between Rewriting, Answering and Losslessness

  2005cited by this paper
• Transaction support for indexed views.

  2004cited by this paper
• Bitmap-tree indexing for set operations on free text

  2004cited by this paper
• RE-tree: an efficient index structure for regular expressions

  2003cited by this paper
• ViST: a dynamic index method for querying XML data by tree structures

  2003cited by this paper
• XR-tree: indexing XML data for efficient structural joins

  2003cited by this paper
• The X-tree : An Index Structure for High-Dimensional Data

  2001cited by this paper
• fAST refresh using mass query optimization

  2001cited by this paper
• Answering queries using views: A survey

  2001cited by this paper
• A Scalable Algorithm for Answering Queries Using Views

  2000cited by this paper
• The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation

  2000cited by this paper
• Automated Selection of Materialized Views and Indexes in SQL Databases

  2000cited by this paper
• Evaluation of Materialized View Indexing in Data Warehousing Environments

  2000cited by this paper
• The hybrid tree: an index structure for high dimensional feature spaces

  1999cited by this paper
• Real-time data access control on B-tree index structures

  1999cited by this paper
• Bitmap index design and evaluation

  1998cited by this paper
• Selection of views to materialize in a data warehouse

  1997cited by this paper
• The SR-tree: an index structure for high-dimensional nearest neighbor queries

  1997cited by this paper
• Answering Queries with Aggregation Using Views

  1996cited by this paper
• Computing Queries from Derived Relations

  1985cited by this paper
• R-trees: a dynamic index structure for spatial searching

  1984cited by this paper
• View indexing in relational databases

  1982cited by this paper
• The K-D-B-tree: a search structure for large multidimensional dynamic indexes

  1981cited by this paper
• Ubiquitous B-Tree

  1979cited by this paper

• Supporting Efficient Family Joins for Big Data Tables via Multiple Freedom Family Index

  2025cites this paper
• Recursive SQL and GPU-support for in-database machine learning

  2022cites this paper
• In-Database Machine Learning with SQL on GPUs

  2021cites this paper
• An interpolation algorithm fitted for dynamic 3D face reconstruction

  2017cites this paper
• A game theoretic model for dynamic configuration of large-scale intrusion detection signatures

  2016cites this paper
• Design of database for evaluating 3D audio core algorithms

  2016influential citation
• A Review on Dynamic View Selection

  2016cites this paper
• DCCP: an effective data placement strategy for data-intensive computations in distributed cloud computing systems

  2015cites this paper
• Optimization of Progressive Queries via Materialized Views for Large Databases

  2014cites this paper
• Grid-PPPS: A Skyline Method for Efficiently Handling Top-k Queries in Internet of Things

  2014cites this paper