Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
An Effective Approach to Vertical Partitioning for Physical Design of Relational Databases
IEEE Transactions on Software Engineering
Multi-step processing of spatial joins
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Shoring up persistent applications
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Iterators, schedulers, and distributed-memory parallelism
Software—Practice & Experience
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Continuous profiling: where have all the cycles gone?
Proceedings of the sixteenth ACM symposium on Operating systems principles
Performance characterization of a Quad Pentium Pro SMP using OLTP workloads
Proceedings of the 25th annual international symposium on Computer architecture
An analysis of database workload performance on simultaneous multithreaded processors
Proceedings of the 25th annual international symposium on Computer architecture
Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
Cache-conscious data placement
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Benchmark Handbook: For Database and Transaction Processing Systems
Benchmark Handbook: For Database and Transaction Processing Systems
Inside Microsoft SQL Server 7.0 with CD-ROM
Inside Microsoft SQL Server 7.0 with CD-ROM
Database Management Systems
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Compressing Relations and Indexes
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Database Architecture Optimized for the New Bottleneck: Memory Access
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
DBMSs on a Modern Processor: Where Does Time Go?
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Hash-Partitioned Join Method Using Dynamic Destaging Strategy
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Cache Conscious Algorithms for Relational Query Processing
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Architecture-conscious database systems
Architecture-conscious database systems
Improving Preemptive Prioritization via Statistical Characterization of OLTP Locking
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Efficient relational database management using graphics processors
DaMoN '05 Proceedings of the 1st international workshop on Data management on new hardware
Efficient execution of multiple queries on deep memory hierarchy
Journal of Computer Science and Technology
Staircase join: teach a relational DBMS to watch its (axis) steps
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Read-Optimized, Cache-Conscious, Page Layouts for Temporal Relational Data
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Row-wise parallel predicate evaluation
Proceedings of the VLDB Endowment
Brighthouse: an analytic data warehouse for ad-hoc queries
Proceedings of the VLDB Endowment
The five-minute rule 20 years later (and how flash memory changes the rules)
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
Query processing techniques for solid state drives
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Injecting domain knowledge into a granular database engine: a position paper
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
MOSS-DB: a hardware-aware OLAP database
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Secure personal data servers: a vision paper
Proceedings of the VLDB Endowment
Data management over flash memory
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Improving performance by creating a native join-index for OLAP
Frontiers of Computer Science in China
Multi-core vs. I/O wall: the approaches to conquer and cooperate
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Efficient maintenance of ephemeral data
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
MiniTasking: improving cache performance for multiple query workloads
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Micro-specialization: dynamic code specialization of database management systems
Proceedings of the Tenth International Symposium on Code Generation and Optimization
CDDTA-JOIN: one-pass OLAP algorithm for column-oriented databases
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
SI-CV: snapshot isolation with co-located versions
TPCTC'11 Proceedings of the Third TPC Technology conference on Topics in Performance Evaluation, Measurement and Characterization
From A to E: analyzing TPC's OLTP benchmarks: the obsolete, the ubiquitous, the unexplored
Proceedings of the 16th International Conference on Extending Database Technology
STREX: boosting instruction cache reuse in OLTP workloads through stratified transaction execution
Proceedings of the 40th Annual International Symposium on Computer Architecture
Design and evaluation of storage organizations for read-optimized main memory databases
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Relational database systems have traditionally optimized for I/Operformance and organized records sequentially on disk pages usingthe N-ary Storage Model (NSM) (a.k.a., slotted pages). Recentresearch, however, indicates that cache utilization and performanceis becoming increasingly important on modern platforms. In thispaper, we first demonstrate that in-page data placement is the keyto high cache performance and that NSM exhibits low cacheutilization on modern platforms. Next, we propose a new dataorganization model called PAX (Partition Attributes Across), thatsignificantly improves cache performance by grouping together allvalues of each attribute within each page. Because PAX only affectslayout inside the pages, it incurs no storage penalty and does notaffect I/O behavior. According to our experimental results (whichwere obtained without using any indices on the participatingrelations), when compared to NSM: (a) PAX exhibits superior cacheand memory bandwidth utilization, saving at least 75% of NSM'sstall time due to data cache accesses; (b) range selection queriesand updates on memory-resident relations execute 1725% faster; and(c) TPC-H queries involving I/O execute 1148% faster. Finally, weshow that PAX performs well across different memory system designs.