ACM Transactions on Database Systems (TODS)
Model 204 Architecture and Performance
Proceedings of the 2nd International Workshop on High Performance Transaction Systems
The optimization of queries in relational databases
The optimization of queries in relational databases
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Providing better support for a class of decision support queries
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Generating association rules from semi-structured documents using an extended concept hierarchy
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
An alternative storage organization for ROLAP aggregate views based on cubetrees
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Caching multidimensional queries using chunks
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Bitmap index design and evaluation
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
An efficient bitmap encoding scheme for selection queries
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Query optimization for selections using bitmaps
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Requirement-based data cube schema design
Proceedings of the eighth international conference on Information and knowledge management
Spot: distance based join indices for spatial data
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
The DataIndex: a structure for smaller, faster data warehouses
ACM SIGMIS Database
Space efficient bitmap indexing
Proceedings of the ninth international conference on Information and knowledge management
XPS a database server for data warehousing
Proceedings of the 4th ACM international workshop on Data warehousing and OLAP
Efficient execution of joins in a star schema
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Finding an efficient rewriting of OLAP queries using materialized views in data warehouses
Decision Support Systems
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
IEEE Transactions on Knowledge and Data Engineering
Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Performance Measurements of Compressed Bitmap Indices
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Generalised Hash Teams for Join and Group-by
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
What can Hierarchies do for Data Warehouses?
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Multi-Dimensional Database Allocation for Parallel Data Warehouses
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Optimizing Queries on Compressed Bitmaps
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
WARLOCK: A Data Allocation Tool for Parallel Warehouses
Proceedings of the 27th International Conference on Very Large Data Bases
Join Indices as a Tool for Spatial Data Mining
TSDM '00 Proceedings of the First International Workshop on Temporal, Spatial, and Spatio-Temporal Data Mining-Revised Papers
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
OLAP Query Processing Algorithm Based on Relational Storage
WAIM '02 Proceedings of the Third International Conference on Advances in Web-Age Information Management
Dynamic Query Scheduling in Parallel Data Warehouses
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
An Optimization Problem in Data Cube System Design
PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
Exploiting early sorting and early partitioning for decision support query processing
The VLDB Journal — The International Journal on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
Why is the snowflake schema a good data warehouse design?
Information Systems
SISYPHUS: the implementation of a chunk-based storage manager for OLAP data cubes
Data & Knowledge Engineering - Special issue: Advances in OLAP
Efficient OLAP operations for spatial data using peano trees
DMKD '03 Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
Querying multidimensional data
Multidimensional databases
Usability-based caching of query results in OLAP systems
Journal of Systems and Software
Exploiting hierarchical clustering in evaluating multidimensional aggregation queries
DOLAP '03 Proceedings of the 6th ACM international workshop on Data warehousing and OLAP
Optimization in Data Cube System Design
Journal of Intelligent Information Systems
Arranging fact table records in a data warehouse to improve query performance
Computers and Operations Research
Selection of Views to Materialize in a Data Warehouse
IEEE Transactions on Knowledge and Data Engineering
Optimizing bitmap indices with efficient compression
ACM Transactions on Database Systems (TODS)
Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more
Extending the data warehouse for service provisioning data
Data & Knowledge Engineering - Special issue: ER 2003
Supporting ranking and clustering as generalized order-by and group-by
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
GhostDB: querying visible and hidden data without leaks
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Processing star queries on hierarchically-clustered fact tables
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Star join revisited: Performance internals for cluster architectures
Data & Knowledge Engineering
Maximizing the output rate of multi-way join queries over streaming information sources
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
RadixZip: linear time compression of token streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
International Journal of Business Intelligence and Data Mining
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Column-stores vs. row-stores: how different are they really?
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Hierarchical clustering for OLAP: the CUBE File approach
The VLDB Journal — The International Journal on Very Large Data Bases
Algorithms for distributional and adversarial pipelined filter ordering problems
ACM Transactions on Algorithms (TALG)
Investigating design choices between Bitmap index and B-tree index for a large data warehouse system
ACS'08 Proceedings of the 8th conference on Applied computer scince
Model and procedure for performance and availability-wise parallel warehouses
Distributed and Parallel Databases
Distributed and Parallel Databases
A spatial bitmap-based index for geographical data warehouses
Proceedings of the 2009 ACM symposium on Applied Computing
Traverse: Simplified Indexing on Large Map-Reduce-Merge Clusters
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Keyword query cleaning using hidden Markov models
Proceedings of the First International Workshop on Keyword Search on Structured Data
Data mining-based materialized view and index selection in data warehouses
Journal of Intelligent Information Systems
HOBI: Hierarchically Organized Bitmap Index for Indexing Dimensional Data
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Efficient joins with compressed bitmap indexes
Proceedings of the 18th ACM conference on Information and knowledge management
Inverted indexes vs. bitmap indexes in decision support systems
Proceedings of the 18th ACM conference on Information and knowledge management
Analyses of multi-level and multi-component compressed bitmap indexes
ACM Transactions on Database Systems (TODS)
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Design of the ERATOSTHENES OLAP server
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
View materialization vs. indexing: balancing space constraints in data warehouse design
CAiSE'03 Proceedings of the 15th international conference on Advanced information systems engineering
Matrix "Bit" loaded: a scalable lightweight join query processor for RDF data
Proceedings of the 19th international conference on World wide web
Time-HOBI: indexing dimension hierarchies by means of hierarchically organized bitmaps
DOLAP '10 Proceedings of the ACM 13th international workshop on Data warehousing and OLAP
Effective bitmap indexing for non-metric similarities
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
Optimal view selection for multidimensional database systems
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
A query answering greedy algorithm for selecting materialized views
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II
Efficient processing of drill-across queries over geographic data warehouses
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
Data warehouses in grids with high qos
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Ad hoc star join query processing in cluster architectures
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Time-HOBI: Index for optimizing star queries
Information Systems
Foundations and Trends in Databases
Scalable Join Queries in Cloud Data Stores
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Selection and pruning algorithms for bitmap index selection problem using data mining
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Pruning search space of physical database design
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Materialised view construction in data warehouse for decision making
International Journal of Business Information Systems
Immune algorithm for bitmap join indexes
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
On contextual ranking queries in databases
Information Systems
Column imprints: a secondary index structure
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
International Journal of Intelligent Information and Database Systems
Intelligent Decision Technologies
Hi-index | 0.00 |
This technical note shows how to combine some well-known techniques to create a method that will efficiently execute common multi-table joins. We concentrate on a commonly occurring type of join known as a star-join, although the method presented will generalize to any type of multi-table join. A star-join consists of a central detail table with large cardinality, such as an orders table (where an order row contains a single purchase) with foreign keys that join to descriptive tables, such as customers, products, and (sales) agents. The method presented in this note uses join indices with compressed bitmap representations, which allow predicates restricting columns of descriptive tables to determine an answer set (or foundset) in the central detail table; the method uses different predicates on different descriptive tables in combination to restrict the detail table through compressed bitmap representations of join indices, and easily completes the join of the fully restricted detail table rows back to the descriptive tables. We outline realistic examples where the combination of these techniques yields substantial performance improvements over alternative, more traditional query evaluation plans.