Database Research on Modern Computing Architecture
1. Database Research on Modern Computing Architecture September 10, 2010 Kyong-Ha Lee (bart7449@gmail.com) Department of Computer Science KAIST, Daejeon, Korea 2. Brief Overview of This Talk Basic theories and principles about database technology on modern HW • Not much discussion on implementation or tools, but will be happy to discuss them if there are any questions Topics • The immense chan
Fast Intersection of Sorted Lists Using SSE Instructions
Intersection of sorted lists is a cornerstone operation in many applications including search engines and databases because indexes are often implemented using different types of sorted structures. At GridDynamics, we recently worked on a custom database for realtime web analytics where fast intersection of very large lists of IDs was a must for good performance. From a functional point of view, w
Ultimate Sets and Maps for Java, Part I
Highly Scalable BlogArticles on Big Data, NoSQL, and Highly Scalable Software Engineering Some time ago our team had been requested to develop several Java components for structured information retrieval. After the initial research, we concluded that standard approaches like inverted indexes are not well applicable to our problem because of specific business requirements. As a result we faced a ne
DBパフォーマンスチューニングの基礎：インデックス入門
2. 自己紹介 下佐粉 昭 ( しもさこ あきら ) 和歌山県生まれ 2001年 IBMに中途入社 以来、DB2関連の仕事多し 現在はビジネスパートナー様向け技術支援 ■書籍 「即戦力のDB2管理術」 – http://db2.jugem.cc/?eid=2341 （書籍紹介） 「XML-DB開発 実技コース」（共著） 「DB2 逆引きリファレンス」（共著) ■オンライン Twitter - @simosako 全内容をWEBで公開しています – http://twitter.com/simosako http://db2watch.com/ Unofficial DB2 Blog – http://db2.jugem.cc/ 2 3. 今日のテーマ RDBのインデックスって？ –インデクスを作成すると、速度が上がる！ –インデックス作成はパフォーマンスチューニングのキモ！ ...でも、な
wat-arrayでラクラク実装☆FM-Indexの作り方 - EchizenBlog-Zwei
というわけで大変便利なライブラリwat-arrayを使ってFM-Indexを簡単に実装してみるよ。本格的なライブラリは既にFM-Index++という良いものがあるので、本記事では仕組みの解説を目的とする。 参考資料: FM-index++を公開しました - tb_yasuの日記 An alphabet-friendly FM-index (P. Ferragina, G. Manzini, V. Makinen, G. Navarro, 2004) なお、本記事では前回の記事で実装した(ってほどでもないけど)text2bwt()とLF()を使っている。 話題のwat-arrayを使ってBurrows-Wheeler変換(BWT)してみた - EchizenBlog-Zwei 今回もテキストとしてmississippi#を使う。まずテキストから任意のキーの出現回数を得る関数get_rows(
BlinkDB: Queries with Bounded Errors and Bounded Response Times on Very Large Data
Queries with Bounded Errors and Bounded Response Times on Very Large Data BlinkDB is a massively parallel, approximate query engine for running interactive SQL queries on large volumes of data. It allows users to trade-off query accuracy for response time, enabling interactive queries over massive data by running queries on data samples and presenting results annotated with meaningful error bars.
Start - weighttp - lighty labs
weighttp¶ About¶ weighttp (pronounced weighty) is a lightweight and small benchmarking tool for webservers. It was designed to be very fast and easy to use and only supports a tiny fraction of the HTTP protocol in order to be lean and simple. weighttp supports multithreading to make good use of modern CPUs with multiple cores as well as asynchronous i/o for concurrent requests within a single thre
MySQLとInternal ELB - まめ畑
VPC上でInternal ELBが提供され、slave群をInternal ELB配下に置くことで、slaveサーバの冗長化が出来るようになりました。 そこで、ELB配下に配置した際のパフォーマンスの劣化と注意点を見つけるためにパフォーマンス測定をしてみました。 色々 DB: とあるデータ件数の多いDB コネクション数: 100,200,300,400,500,600,700,800 試行回数: 1クライアントにつき 100回 クエリはランダムに発行 ELB配下には２台配置 結果 スループット(qps) スループットが上がっているのは、キャッシュヒット率が上がっているため connection DIRECT ELB 100 1897.5 1703.5 200 2075.1 1696.3 300 2286.79 1897.37 400 3098.5 2033.93 500 3255.8 2
Home
HYRISE is an open-source in-memory database designed and developed at our research group. The database is actively used in our database teaching and research activities. As such, it steadily continues to be extended with new features and functionality. HYRISE is available on Github. 22.09.2023 | Trends and Concepts in the Softwareindustry Seminar offered in WiSe 2023/2024 Trends and Concepts in th
(SSB)Star Schema Bechmark: InfoBright, InfiniDB and LucidDB
In my previous rounds with DataWarehouse oriented engines I used single table without joins, and with small (as for DW) datasize (see https://www.percona.com/blog/2009/10/02/analyzing-air-traffic-performance-with-infobright-and-monetdb/, https://www.percona.com/blog/2009/10/26/air-traffic-queries-in-luciddb/, https://www.percona.com/blog/2009/11/02/air-traffic-queries-in-infinidb-early-alpha/). Ad
Open Source Data Warehousing? :: Tholis Consulting
The economic downturn is causing an increasing interest in using open source (OS) solutions for BI. One of my previous blogposts already raised the issue of the missing pieces in open source analytical databases, but nevertheless more and more companies are using OS databases for data warehouse purposes. In fact, recent Gartner research indicated that almost 18% of the surveyed organizations are u
12. Indexing and Hashing in DBMS
1. Chapter 12: Indexing and Hashing Basic Concepts Ordered Indices B+-Tree Index Files B-Tree Index Files Static Hashing Dynamic Hashing Comparison of Ordered Indexing and Hashing Index Definition in SQL Multiple-Key Access 2. Basic Concepts Indexing mechanisms used to speed up access to desired data. E.g., author catalog in library Search Key - attribute to set of attributes used to look up recor
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Bitmap Index – when to use it?
Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap Indexes
Ultimate Sets and Maps for Java, Part II
Performance of Priority Queue Sorting with Pagination
Performance Tweaks and Tools For Linux | PDF | Transmission Control Protocol | Device Driver
GitHub - google/leveldb: LevelDB is a fast key-value storage library written at Google that provides an ordered mapping from string keys to string values.
Google Code Archive - Long-term storage for Google Code Project Hosting.
Google Code Archive - Long-term storage for Google Code Project Hosting.