ACM Transactions on Database Systems (TODS)
Red brick warehouse: a read-mostly RDBMS for open SMP platforms
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Making B+- trees cache conscious in main memory
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
AlphaSort: a cache-sensitive parallel external sort
The VLDB Journal — The International Journal on Very Large Data Bases
Multiprocessor Join Scheduling
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the 17th International Conference on Data Engineering
Efficient Bulk Deletes in Relational Databases
Proceedings of the 17th International Conference on Data Engineering
Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
A Study of Index Structures for Main Memory Database Management Systems
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A Novel Index Supporting High Volume Data Warehouse Insertion
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Weaving Relations for Cache Performance
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient Search of Multi-Dimensional B-Trees
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The LHAM log-structured history data access method
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient exploitation of similar subexpressions for query processing
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Scheduling of page-fetches in join operations
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Cooperative scans: dynamic bandwidth sharing in a DBMS
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
The five-minute rule twenty years later, and how flash memory changes the rules
DaMoN '07 Proceedings of the 3rd international workshop on Data management on new hardware
Optimizing complex queries with multiple relation instances
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Brighthouse: an analytic data warehouse for ad-hoc queries
Proceedings of the VLDB Endowment
Self-organizing tuple reconstruction in column-stores
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Self-selecting, self-tuning, incrementally optimized indexes
Proceedings of the 13th International Conference on Extending Database Technology
YCSB++: benchmarking and performance debugging advanced features in scalable table stores
Proceedings of the 2nd ACM Symposium on Cloud Computing
Concurrency control for adaptive indexing
Proceedings of the VLDB Endowment
Deferred maintenance of indexes and of materialized views
DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems
Instant loading for main memory databases
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
For efficient query processing, a relational table should be indexed in multiple ways; for efficient database loading, indexes should be omitted. This research introduces new techniques called zones filters, zone indexes, adaptive merging, and partition filters. The new data structures can be created as side effects of the load process, with all required analyses accomplished while a moderate amount of new data still remains in the buffer pool. Traditional sorting and indexing are not required. Nonetheless, query performance matches that of Netezza's zone maps where those apply, exceeds it for the many predicates for which zone maps are ineffective, and can be comparable to query processing with traditional indexing, as demonstrated in our simulations.