Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Umar Farooq Minhas"'
Autor:
Geoffrey X. Yu, Markos Markakis, Andreas Kipf, Per-Åke Larson, Umar Farooq Minhas, Tim Kraska
Publikováno v:
Proceedings of the VLDB Endowment. 16:99-112
Many modern key-value stores, such as RocksDB, rely on log-structured merge trees (LSMs). Originally designed for spinning disks, LSMs optimize for write performance by only making sequential writes. But this optimization comes at the cost of reads:
Autor:
Mike Barnett, Sebastian Burckhardt, Darren Gehring, Niel Lebeck, Christopher S. Meiklejohn, Badrish Chandramouli, Ryan R. Newton, Irene Zhang, Jonathan Goldstein, Umar Farooq Minhas, Ahmed S. Abdelhamid, Tal Zaccai, Rahee Ghosh Peshawaria
Publikováno v:
Proceedings of the VLDB Endowment. 13:588-601
When writing today's distributed programs, which frequently span both devices and cloud services, programmers are faced with complex decisions and coding tasks around coping with failure, especially when these distributed components are stateful. If
Autor:
Yinan Li, Johannes Gehrke, Tim Kraska, Jialin Ding, Badrish Chandramouli, Ying Li, Chi Wang, Donald Kossmann, Umar Farooq Minhas
Publikováno v:
SIGMOD Conference
Today, businesses rely on efficiently running analytics on large amounts of operational and historical data to gain business insights and competitive advantage. Increasingly, such analytics are run using cloud-based data analytics services, such as G
Publikováno v:
ICDE Workshops
This paper aims to initiate a discussion around benchmarking data management systems with machine-learned components. Traditional benchmarks such as TPC or YCSB are insufficient to analyze and understand these learned systems because they evaluate th
The recently released persistent memory (PM) offers high performance, persistence, and is cheaper than DRAM. This opens up new possibilities for indexes that operate and persist data directly on the memory bus. Recent learned indexes exploit data dis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::696599cccf7e30106d85545503a4d833
Autor:
Christian Holz, David Ledo, Xiaokuan Zhang, Hemant Bhaskar Surale, Nathalie Henry Riche, Anand Waghmare, Frederik Brudy, Jonathan Goldstein, Marcus Peinado, Michel Pahud, Umar Farooq Minhas, William A. S. Buxton, Shannon Joyner, Badrish Chandramouli, Ken Hinckley
Publikováno v:
UIST
Knowledge work increasingly spans multiple computing surfaces. Yet in status quo user experiences, content as well as tools, behaviors, and workflows are largely bound to the current device-running the current application, for the current user, and a
Autor:
Chi Wang, Rajeev Acharya, Zongheng Yang, Badrish Chandramouli, Umar Farooq Minhas, Yinan Li, Per-Ake Larson, Johannes Gehrke, Donald Kossmann
Publikováno v:
SIGMOD Conference
Corporations today collect data at an unprecedented and accelerating scale, making the need to run queries on large datasets increasingly important. Technologies such as columnar block-based data organization and compression have become standard prac
Autor:
David Carrera, Clemens Szyperski, Raghu Ramakrishnan, Nicolas Poggi, Thomas Fenech, Alejandro Montero, José A. Blakeley, Donald Kossmann, Josep Lluis Berral, Umar Farooq Minhas, Víctor Cuevas-Vicenttín, Gonzalo Gómez, Davide Brini
Publikováno v:
Performance Evaluation and Benchmarking for the Era of Cloud(s) ISBN: 9783030550233
TPCTC
TPCTC
We introduce an extension for TPC benchmarks addressing the requirements of big data processing in cloud environments. We characterize it as the Elasticity Test and evaluate under TPCx-BB (BigBench). First, the Elasticity Test incorporates an approac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01a9513de161773f820ae6f89f02f5c4
https://doi.org/10.1007/978-3-030-55024-0_1
https://doi.org/10.1007/978-3-030-55024-0_1
Publikováno v:
Proceedings of the VLDB Endowment. 11:1702-1714
Database systems use many pointer-based data structures, including hash tables and B+-trees, which require extensive "pointer-chasing." Each pointer dereference, e.g., during a hash probe or a B+-tree traversal, can result in a CPU cache miss, stalli
Publikováno v:
Proceedings of the VLDB Endowment. 11:553-565