Zobrazeno 1 - 10
of 17
pro vyhledávání: '"John Cieslewicz"'
Autor:
John Cieslewicz, Jun Xu, Jeff Shute, Ziyang Chen, Qiang Zeng, Jiacheng Yang, Goetz Graefe, Jun Ma, Xi Zhao, Jeffrey F. Naughton, Qilin Dong, Jeremy Wood, Kelvin Lau, Zhan Yuan, Junxiong Zhou, Ian Rae, Yuan Gao
Publikováno v:
Proceedings of the VLDB Endowment. 13:3313-3325
The ongoing and increasing interest in HTAP (Hybrid Transactional and Analytical Processing) systems documents the intense interest from data owners in simultaneously running transactional and analytical workloads over the same data set. Much of the
Autor:
Thanh Do, Ahmed M. Aly, Somayeh Sardashti, Yiqun Wei, Yang Xia, Zhepeng Yan, Jiacheng Yang, John Cieslewicz, Jun Xu, Shiv Venkataraman, Andrew Harn, Craig Chasseur, Jeff Shute, Felix Weigel, Chanjun Yang, Orri Erling, Andrey Gubichev, Ben Handy, Anurag Biyani, Amr El-Helw, Himani Apte, Daniel Tenedorio, Jason Govig, Petros Venetis, Goetz Graefe, Divy Agrawal, Jiexing Li, Ian Rae, Zhan Yuan, Ashish Gupta, Qiang Zeng, Colin Zheng, David G. Wilhite, Mohan Yang, Keith Peters, Bart Samwel
Publikováno v:
Proceedings of the VLDB Endowment. 11:1835-1848
F1 Query is a stand-alone, federated query processing platform that executes SQL queries against data stored in different file-based formats as well as different storage systems at Google (e.g., Bigtable, Spanner, Google Spreadsheets, etc.). F1 Query
Autor:
John Cieslewicz, Chad Whipkey, David Menestrina, Himani Apte, Traian Stancescu, Jeff Shute, Kyle Littlefield, Radek Vingralek, Eric Rollins, Stephan Ellner, Ben Handy, Mircea Oancea, Bart Samwel, Ian Rae
Publikováno v:
Proceedings of the VLDB Endowment. 6:1068-1079
F1 is a distributed relational database system built at Google to support the AdWords business. F1 is a hybrid database that combines high availability, the scalability of NoSQL systems like Bigtable, and the consistency and usability of traditional
Autor:
Kenneth A. Ross, John Cieslewicz
Publikováno v:
Encyclopedia of Database Systems ISBN: 9781489979933
Encyclopedia of Database Systems
Encyclopedia of Database Systems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ceb9c33fea68ce2d5275ece311991c5a
https://doi.org/10.1007/978-1-4899-7993-3_659-2
https://doi.org/10.1007/978-1-4899-7993-3_659-2
Autor:
Keith Ito, Arvind Arasu, Shivnath Babu, Mayur Datar, Brian Babcock, Jennifer Widom, John Cieslewicz, Utkarsh Srivastava, Rajeev Motwani
Publikováno v:
Data-Centric Systems and Applications ISBN: 9783540286073
Data Stream Management
Data Stream Management
Traditional database management systems are best equipped to run one-time queries over finite stored data sets. However, many modern applications such as network monitoring, financial analysis, manufacturing, and sensor networks require long-running,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::082d84c25b92b24c84368bb761f8bee1
https://doi.org/10.1007/978-3-540-28608-0_16
https://doi.org/10.1007/978-3-540-28608-0_16
Publikováno v:
Proceedings of the VLDB Endowment. 2:1402-1413
A user-defined function (UDF) is a powerful database feature that allows users to customize database functionality. Though useful, present UDFs have numerous limitations, including install-time specification of input and output schema and poor abilit
Autor:
Kenneth A. Ross, John Cieslewicz
Publikováno v:
Proceedings of the IEEE. 96:863-878
Databases are an important workload for modern commodity microarchitectures. Achieving the best performance requires that careful attention be paid to the underlying architecture, including instruction and data cache usage, data layout, branch predic
Publikováno v:
SIGMOD Conference
To take full advantage of the parallelism offered by a multi-core machine, one must write parallel code. Writing parallel code is difficult. Even when one writes correct code, there are numerous performance pitfalls. For example, an unrecognized data
Publikováno v:
DaMoN
Database processes must be cache-efficient to effectively utilize modern hardware. In this paper, we analyze the importance of temporal locality and the resultant cache behavior in scheduling database operators for in-memory, block oriented query pro
Autor:
Kenneth A. Ross, John Cieslewicz
Publikováno v:
ICDT
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (or balanced) parallel subtasks. In this paper, we aim to find, materiali