Predictable performance for unpredictable workloads

Proceedings of the VLDB Endowment

Volumn 2, Issue 1, 2009, Pages 706-717

  Unterbrunner, P ^a   Giannikis, G ^a   Alonso, G ^a   Fauser, D ^b   Kossmann, D ^a  

^a ETH ZURICH   (Switzerland)

^b Amadeus IT Group SA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE; DISTRIBUTED COMPUTER SYSTEMS; HARDWARE;

DATA STREAM PROCESSING; GUARANTEED ACCESS; MAIN MEMORY; MULTI CORE; QUERY PROCESSING TECHNIQUES; RELATIONAL TABLES; STORAGE NODES;

DATA HANDLING;

EID: 77954709590     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687627.1687707     Document Type: Article

References (25)

1. A. Ailamaki et al. Weaving relations for cache performance. In Proc. VLDB '01, 2001.
2. P. M. G. Apers et al. Prisma/db: A parallel, main memory relational dbms. IEEE TKDE, 4(6), 1992.
3. H. Berenson et al. A critique of ansi sql isolation levels. In Proc. SIGMOD '95, 1995.
4. P. A. Boncz et al. Database architecture optimized for the new bottleneck: Memory access. In Proc. VLDB '99, 1999.
5. P. A. Boncz et al. Monetdb/x100: Hyper-pipelining query execution. In Proc. CIDR '05, 2005.
6. S. Chandrasekaran and M. J. Franklin. Streaming queries over streaming data. In Proc. VLDB '02, 2002.
7. D. J. Dewitt et al. The gamma database machine project. IEEE TKDE, 2(1), 1990.
8. D. J. DeWitt et al. An evaluation of non-equijoin algorithms. In Proc. VLDB '91, 1991.
9. F. Fabret et al. Filtering algorithms and implementation for very fast publish/subscribe systems. In Proc. SIGMOD '01, 2001.
10. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci., 31(2):182-209, 1985.
11. A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proc. SIGMOD '84, 1984.
12. S. Harizopoulos et al. Qpipe: A simultaneously pipelined relational query engine. In Proc. SIGMOD '05, 2005.
13. A. Kleen. A numa api for linux. Novell Technical Whitepaper, 2005. http://www.novell.com/-resourcecenter/ext item.jsp?itemId=14444.
14. C. Lang et al. Increasing buffer-locality for multiple relational table scans through grouping and throttling. Proc. ICDE '07, 2007.
15. D. B. Lomet. Key range locking strategies for improved concurrency. In Proc. VLDB '93, 1993.
16. C. Mohan et al. Aries: A transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. ACM TODS, 17:94-162, 1992.
17. L. Qiao et al. Main-memory scan sharing for multi-core cpus. Proc. VLDB '08, 1(1), 2008.
18. V. Raman et al. Constant-time query processing. In Proc. ICDE '08, 2008.
19. M. Ronström and L. Thalmann. Mysql cluster architecture overview: High availability features of mysql cluster. MySQL Technical Whitepaper, 2004. http://www.techworld.com/whitepapers/index.cfm?-whitepaperid=5663.
20. K. A. Ross. Conjunctive selection conditions in main memory. In Proc. PODS '02, 2002.
21. K. A. Ross. Selection conditions in main memory. ACM TODS, 29(1), 2004.
22. T. K. Sellis. Multiple-query optimization. ACM TODS, 13(1):23-52, 1988.
23. K.-Y. Whang et al. A linear-time probabilistic counting algorithm for database applications. ACM TODS, 15(2):208-229, 1990.
24. W. A. Wulf and S. A. McKee. Hitting the memory wall: implications of the obvious. ACM SIGARCH Comput. Archit. News, 23(1):20-24, 1995.
25. M. Zukowski et al. Cooperative scans: Dynamic bandwidth sharing in a dbms. In Proc. VLDB '07, 2007.