SparqlImplementations - W3C Wiki
This page lists some implementations of SPARQL, a query language and protocol for RDF acccess released by the W3C RDF Data Access Working Group - DAWG. SPARQL query language spec SPARQL Protocol spec SPARQL XML results spec SPARQL Implementation Survey See DawgShows for online demos and services. Client Side Gruff provides a Graphical Query View which allows creating SPARQL and Prolog queries as d
ログ解析基盤におけるストリーム処理パイプラインについて
PFN のオンプレML基盤の取り組み / オンプレML基盤 on Kubernetes 〜PFN、ヤフー〜 PFNは，「現実世界を計算可能にする」をVisionとして，膨大な計算量を必要とするシミュレーションや深層学習などの計算ワークロードを実行するためのオンプレML基盤を持っています． この取り組みについて、「使いやすい環境」、「リソースの効率的かつフェアな利用」、「信頼性・運用省力化」の観点から紹介します。 本イベント「オンプレML基盤 on Kubernetes 〜PFN、ヤフー〜」では、オンプレミスの Kubernetes クラスタ上に構築された機械学習基盤を持つ PFN とヤフーのエンジニアが自社での取り組みについて語り尽くします！ イベントサイト: https://ml-kubernetes.connpass.com/event/239859/
What Every Computer Scientist Should Know About Floating-Point Arithmetic
What Every Computer Scientist Should Know About Floating-Point Arithmetic Note – This appendix is an edited reprint of the paper What Every Computer Scientist Should Know About Floating-Point Arithmetic, by David Goldberg, published in the March, 1991 issue of Computing Surveys. Copyright 1991, Association for Computing Machinery, Inc., reprinted by permission. Abstract Floating-point arithmetic i
dablooms - an open source, scalable, counting bloom filter library
OverviewThis project aims to demonstrate a novel bloom filter implementation that can scale, and provide not only the addition of new members, but reliable removal of existing members. Motivationbitly has billions and billions of links and an infrastructure that serves thousands of decode requests per second, i.e. redirect the user from bit.ly/short to the long.destination.url.com/with/path. Users
Big Data Counting: How to count a billion distinct objects using only 1.5KB of Memory - High Scalability -
The table shows that we can count the words with a 3% error rate using only 512 bytes of space. Compare that to a perfect count using a HashMap that requires nearly 10 megabytes of space and you can easily see why cardinality estimators are useful. In applications where accuracy is not paramount, which is true for most web scale and network counting scenarios, using a probabilistic counter can res
Hflush11
1 Append/Hflush/Read Design Hairong Kuang, Konstantin Shvachko, Nicholas Sze, Sanjay Radia, Robert Chansler Yahoo! HDFS team 08/06/2009 1. Design challenges With hflush, HDFS needs to make the last block of an unclosed file visible to readers. This presents two challenges: 1. Read consistency. At a given time different replicas of the last block may have different number of bytes. What read consis
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
https://github.com/cloudera/hue/blob/release-4.2.0/desktop/core/src/desktop/metrics.py
https://github.com/cloudera/hue/tree/master/desktop/core/src/desktop/lib/metrics
How companies are using Spark - O'Reilly Media
Cloudera Blog
Taking the Emmys by Storm
Mahoutにパッチを送ってみた
Using random numbers in Hadoop MapReduce is dangerous
Dealing with skewed key sizes in Cascading
Reading files quickly in Java
Parallelized bloom filter creation with Map/Reduce
What are some good MapReduce implementations for graphs, meaning a general use, highly distributed, open source graph framework, and how ...
MapReduceによる大規模データ処理 at Yahoo! JAPAN
Decision Trees & Hadoop - Part 1: Data
Public Service Announcement: Google Collections Library 0.5 (ALPHA)