Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Gopi K. Attaluri"'
Autor:
Gopi K. Attaluri, Naresh K. Chainani, Vijayshankar Raman, Guy M. Lohman, Ippokratis Pandis, Richard S. Sidle, Ronald J. Barber, Sam Lightstone, David C. Sharpe
Publikováno v:
Proceedings of the VLDB Endowment. 8:353-364
We present new hash tables for joins, and a hash join based on them, that consumes far less memory and is usually faster than recently published in-memory joins. Our hash join is not restricted to outer tables that fit wholly in memory. Key to this h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ccd7eb1a0e08bba1dc040dbe630cc77a
https://doi.org/10.14778/2735496.2735499
https://doi.org/10.14778/2735496.2735499
Autor:
Vincent Kulandai Samy, Oliver Draese, Lin Qiao, Sam Lightstone, Knut Stolze, Naresh K. Chainani, Jae-Gil Lee, Min-Soo Kim, Gopi K. Attaluri, Ippokratis Pandis, Konstantinos Morfonios, Frederick Ho, Guy M. Lohman, Vijayshankar Raman, Stratos Idreos, Keshava Murthy, Richard S. Sidle, Ronald J. Barber, Liping Zhang
Publikováno v:
Proceedings of the VLDB Endowment. 7:1355-1366
Compression has historically been used to reduce the cost of storage, I/Os from that storage, and buffer pool utilization, at the expense of the CPU required to decompress data every time it is queried. However, significant additional CPU efficiencie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::743855c3bfbf892d5c5cce0c6752ecd7
https://doi.org/10.14778/2733004.2733008
https://doi.org/10.14778/2733004.2733008
Autor:
Vijayshankar Raman, Shaorong Liu, Ronald J. Barber, Liping Zhang, Adam J. Storm, Jens Leenstra, David Kalmuk, Rene Mueller, Berni Schiefer, Tim Malkemus, Sam Lightstone, Ippokratis Pandis, David C. Sharpe, Vincent Kulandaisamy, Richard S. Sidle, Gopi K. Attaluri, Guy M. Lohman, Naresh K. Chainani
Publikováno v:
Proceedings of the VLDB Endowment. 6:1080-1091
DB2 with BLU Acceleration deeply integrates innovative new techniques for defining and processing column-organized tables that speed read-mostly Business Intelligence queries by 10 to 50 times and improve compression by 3 to 10 times, compared to tra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec9b013b482b8a89cd9553d4900582e8
https://doi.org/10.14778/2536222.2536233
https://doi.org/10.14778/2536222.2536233
Autor:
Gopi K. Attaluri, K. Salem
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 14:1190-1196
This paper describes the presumed-either two-phase commit protocol. Presumed-either exploits log piggybacking to reduce the cost of committing transactions. If timely piggybacking occurs, presumed-either combines the performance advantages of presume
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acd7bd3f2ae93a6394ac8dab88b2bfa8
https://doi.org/10.1109/tkde.2002.1033784
https://doi.org/10.1109/tkde.2002.1033784
Autor:
Neil Coburn, Avi Silberschatz, Gopi K. Attaluri, Jacob Slonim, Patrick Martin, Dexter P. Bradshaw, Q. Zhu, Per-Åke Larson
Publikováno v:
IBM Systems Journal. 34:39-62
In virtually every organization, data are stored in a variety of ways and managed by different database and file systems. Applications requiring data from multiple sources must recognize and deal with the specifics of each data source and must also p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e14b23b2d27578661ce998834770c506
https://doi.org/10.1147/sj.341.0039
https://doi.org/10.1147/sj.341.0039
Publikováno v:
HICSS (7)
Current research projects and database product extensions reflect the importance of unconventional database applications (for example, document processing and computer aided design). Unconventional applications differ from the conventional ones (for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06057be23e9f59621c542d31a26781ce
https://doi.org/10.1109/hicss.1998.649226
https://doi.org/10.1109/hicss.1998.649226