[B! dataStructure] manboubirdã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

manboubird id:manboubird

dataStructureã«é–¢ã™ã‚‹manboubirdã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (43)

${{author_name}}$

{{author_name}} {{created}}

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

{{#following_bookmarks}}

${{author_name}}$

{{author_name}} {{created}}

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

{{/following_bookmarks}}

{{/is_wiped}}

LlamaIndexã‚’å®Œå…¨ã«ç†è§£ã™ã‚‹ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ« ãã®ï¼‘ï¼šå‡¦ç†ã®æ¦‚å¿µã‚„æµã‚Œã‚’ç†è§£ã™ã‚‹åŸºç¤Žç·¨ï¼ˆv0.6.8å¯¾å¿œï¼‰ | DevelopersIO
ãªãŠRetrieverModeã¯ã€å¾Œè¿°ã™ã‚‹as_query_engineã§QueryEngineã‚’ä½œæˆã™ã‚‹éš›ã«ä¸Žãˆã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚ Contextã«ã¤ã„ã¦ Indexã¨Retrieverã¯å¯†æŽ¥ã«é–¢é€£ã—ã¦ã„ã‚‹ã‚‚ã®ã§ã™ãŒã€ãã‚Œã¨ã¯åˆ¥ã«ä¾å˜ã™ã‚‹å‡¦ç†ã‚¯ãƒ©ã‚¹ã‚’Contextã¨ã—ã¦ä¸Žãˆã¾ã™ã€‚ ã“ã®Contextã¯å…·ä½“çš„ã«ã¯ã€Storage Contextã¨Service Contextã®ï¼’ç¨®é¡žã§ã™ã€‚ å†’é ã®ã‚µãƒ³ãƒ—ãƒ«ã§ã¯ã€ãƒ‡ãƒ•ã‚©ãƒ«ãƒˆã§å‹•ä½œã—ã¦ã„ã‚‹ãŸã‚ContextãŒè¦‹ãˆãªã„ã®ã§ã™ãŒã€æ˜Žç¤ºçš„ã«æ›¸ãã¨ä»¥ä¸‹ã®ã‚ˆã†ã«ãªã‚Šã¾ã™ã€‚ from llama_index import StorageContext from llama_index.storage.docstore import SimpleDocumentStore from llama_index.storage.index_store import
manboubird 2023/06/22
llamaIndex

dataStructure

tutorial

embeddings
ãƒªãƒ³ã‚¯
https://web.stanford.edu/class/cs520/2020/abstracts/rathle.pdf
manboubird 2021/06/21
slide

neo4j

knowledgeGraph

dataStructure
ãƒªãƒ³ã‚¯
Skip List | Brilliant Math & Science Wiki
manboubird 2021/04/04
linkedList

skipList

dataStructure
ãƒªãƒ³ã‚¯
RDF Triple Stores vs. Labeled Property Graphs: What's the Difference? - Graph Database & Analytics
Editorâ€™s Note: This presentation was given by JesÃºs Barrasa at GraphConnect San Francisco in October 2016. Presentation Summary Resource Description Framework (RDF) triple stores and labeled property graphs both provide ways to explore and graphically depict connected data. But the two are very different â€“ and each have different strengths in different use cases. In this presentation, Dr. JesÃºs Ba
manboubird 2021/01/17
knowledgeGraph

dataStructure

propertyGraph

rdf

graphDatabase

schemaManagement

tutorial

video

neo4j

rdfStar
ãƒªãƒ³ã‚¯
W3C Workshop on Web Standardization for Graph Data
manboubird 2020/11/11
graphDatabase

w3c

workshop

rdf

propertyGraph

knowledgeGraph

dataStructure

graphQl
ãƒªãƒ³ã‚¯
Writing Clean Python With Namedtuples â€“ dbader.org
Python comes with a specialized â€œnamedtupleâ€ container type that doesnâ€™t seem to get the attention it deserves. Itâ€™s one of these amazing features in Python thatâ€™s hidden in plain sight. Namedtuples can be a great alternative to defining a class manually and they have some other interesting features that I want to introduce you to in this article. Now, whatâ€™s a namedtuple and what makes it so spec
manboubird 2020/11/08
python

tuple

dataStructure
ãƒªãƒ³ã‚¯
What is the pythonic way to read CSV file data as rows of namedtuples?
What is the best way to take a data file that contains a header row and read this row into a named tuple so that the data rows can be accessed by header name? I was attempting something like this: import csv from collections import namedtuple with open('data_file.txt', mode="r") as infile: reader = csv.reader(infile) Data = namedtuple("Data", ", ".join(i for i in reader[0])) next(reader) for row i
manboubird 2020/11/08
python

tuple

dataStructure

csv
ãƒªãƒ³ã‚¯
Rob Pike's Rules of Programming (1989) | Hacker News
> Rule 1. You can't tell where a program is going to spend its time. Bottlenecks occur in surprising places, so don't try to second guess and put in a speed hack until you've proven that's where the bottleneck is.I wish people would follow this rule and just let stuff work. I recently encountered the most extreme version of this I've ever seen in my career: a design review where a guy proposed a R
manboubird 2020/08/18
golang

programming

dataStructure
ãƒªãƒ³ã‚¯
Rob Pike's 5 Rules of Programming
manboubird 2020/08/18
golang

programming

dataStructure
ãƒªãƒ³ã‚¯
ã€ŒGoã®çˆ¶ã€ãƒãƒ–ãƒ»ãƒ‘ã‚¤ã‚¯ã®ã€Œãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°5ã‚«æ¡ã€ã€ãƒãƒƒãƒˆä¸Šã§è©±é¡Œã«
ã€ŒUNIXã¯ãŸã æ»ã‚“ã ã ã‘ã§ãªãã€æœ¬å½“ã«ã²ã©ã„è‡ã„ã‚’æ”¾ã¡å§‹ã‚ã¦ã„ã‚‹ã€ã€Œã‚ãƒ£ãƒƒã‚·ãƒ¥ã¯ã‚¢ãƒ¼ã‚ãƒ†ã‚¯ãƒãƒ£ã§ã¯ãªã„ã€‚å˜ãªã‚‹æœ€é©åŒ–ã ã€ãªã©ã®èªžéŒ²ã‚’ç”Ÿã‚“ã ã€ŒGoã®çˆ¶ã€ã¨ã‚‚å‘¼ã°ã‚Œã‚‹ãƒãƒ–ãƒ»ãƒ‘ã‚¤ã‚¯æ°ã®ã€Œãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°5ã‚«æ¡ã€ã«ã¤ã„ã¦ã€ãƒãƒƒãƒˆä¸Šã§è©±é¡Œã¨ãªã£ã¦ã„ã¾ã™ users.ece.utexas.edu/~adnan/pike.html http://users.ece.utexas.edu/~adnan/pike.html Rob Pike's Rules of Programming (1989) | Hacker News https://news.ycombinator.com/it em?id=24135189 ãƒ‘ã‚¤ã‚¯æ°ã®ã€Œãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°5ã‚«æ¡ã€ã¯ä»¥ä¸‹ã€‚ ãƒ«ãƒ¼ãƒ«1ï¼šãƒ—ãƒã‚°ãƒ©ãƒ ã®ã©ã“ã§å‡¦ç†æ™‚é–“ãŒã‹ã‹ã‚‹ã‹ã¯ã‚ã‹ã‚‰ãªã„ã€‚ãƒœãƒˆãƒ«ãƒãƒƒã‚¯ã¯æ„å¤–ãªå ´æ‰€ã§ç™ºç”Ÿã™ã‚‹ã®ã§ã€ãƒœãƒˆãƒ«ãƒãƒƒã‚¯ãŒã©ã“ã«ã‚ã‚‹ã‹ã‚’è¨¼æ˜Žã™ã‚‹ã¾ã§ã¯ã€è‡†æ¸¬
manboubird 2020/08/18
golang

programming

dataStructure
ãƒªãƒ³ã‚¯
Circllhist -- A Log-Linear Histogram Data Structure for IT Infrastructure Monitoring
manboubird 2020/07/04
visualization

monitoring

observility

paper

siteReliabilityEngineering

circllhist

dataStructure
ãƒªãƒ³ã‚¯
éžå†å¸°åž‹Segment Treeã®Pythonã«ã‚ˆã‚‹å®Ÿè£… - Qiita
ã¯ã˜ã‚ã« ã‚¿ã‚¤ãƒˆãƒ«ã®ã¨ãŠã‚Šã€ã“ã®è¨˜äº‹ã§ã¯Pythonã«ã‚ˆã‚‹éžå†å¸°åž‹Segment Treeã®å®Ÿè£…ã‚’ç´¹ä»‹ã—ãŸã„ã¨æ€ã„ã¾ã™ã€‚ å‰æçŸ¥è˜ã‚’ã€Œã»ã¼ã€1 å¿…è¦ã¨ã—ãªã„ã‚ˆã†ã«Segment Treeã®èª¬æ˜Žã‹ã‚‰å…¥ã‚‹ã®ã§ã€ã‚‚ã†çŸ¥ã£ã¦ã‚‹ã¨ã„ã†æ–¹ã¯èªã¿é£›ã°ã—ã¦ãã ã•ã„ã€‚â†’éžå†å¸°åž‹Segment Treeã®å®Ÿè£… Segment Treeã¨ã¯ é€šç§°ã‚»ã‚°æœ¨ã€ã‚»ã‚°ãƒ¡ãƒ³ãƒˆæœ¨ãªã©ã¨å‘¼ã°ã‚Œã¦ã„ã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã€é•·ã• $N$ ã®é…åˆ—{$a_i$}$_{i=0}^{N-1}$ã«å¯¾ã—ã¦ã€ãƒ¢ãƒŽã‚¤ãƒ‰ $(S,â€¢)$ ã«é–¢ã™ã‚‹æ¬¡ã®2ã¤ã®æ“ä½œãŒã©ã¡ã‚‰ã‚‚æ™‚é–“è¨ˆç®—é‡ãŒ $O(logN)$ ã§è¡Œãˆã¾ã™ã€‚ $update(i, x)$:ã€€ $a_i$ ã‚’ $x$ ã«å¤‰æ›´ã™ã‚‹ $query(l, r)$:ã€€ åŠé–‹åŒºé–“ $[l,r)$ ã«å¯¾ã—ã¦ $a_lâ€¢a_{l+1}â€¢$â€¦$â€¢a_{r-1}$ ã‚’è¿”ã™ ãƒ¢ãƒŽã‚¤ãƒ‰ã¨ã—ã¦ã€ä¸€èˆ¬çš„ãªè¶³ã—ç®—ã‚’è€ƒãˆã‚‹ã¨ã€$q
manboubird 2020/04/07
algorithm

python

segmentTree

dataStructure
ãƒªãƒ³ã‚¯
Regular Expression Search with Suffix Arrays
But because the suffix array is sorted, we can find those entries efficiently by binary searching in the suffix array. The indexes then give us the location of the search string in the larger text. Towards Regular Expression SearchÂ ðŸ”—ï¸Ž We begin with a large corpus of source code we want to do regular expression search over. During indexing, livegrep reads all of the source and flattens them toget
manboubird 2020/03/01
dataStructure

suffixArray

search
ãƒªãƒ³ã‚¯
Tensor Developer Summit 2020
manboubird 2020/02/22
tensor

conference

dataStructure

api

xdCon

python

tensorFlow
ãƒªãƒ³ã‚¯
E-commerce Analysis: Data-Structures and Applications
manboubird 2019/03/09
webAnalysis

ec

sql

rfm

dataStructure

kpi

userAnalysis
ãƒªãƒ³ã‚¯
http://www.vldb.org/pvldb/vol11/p1863-bortnikov.pdf
manboubird 2018/11/20
Accordion: Better Memory Organization for LSM Key-Value Stores

vldb

hbase

yahoo

accordion

dataStructure

memory

keyValueStore
ãƒªãƒ³ã‚¯
http://www.sysml.cc/doc/43.pdf
manboubird 2018/06/11
sysMl

learnedIndex

paper

google

dataStructure

deepLearning

machineLearning
ãƒªãƒ³ã‚¯
A Look at Conflict-Free Replicated Data Types (CRDT)
You may have heard about CRDTs in the past few years if you are into distributed systems. In this post I will give a brief summary of what they are and what kind of guarantees they provide. In short, CRDTs are objects that can be updated without expensive synchronization/consensus and they are guaranteed to converge eventually if all concurrent updates are commutative (see below) and if all update
manboubird 2018/06/10
Conflict-Free Replicated Data Types

dataStructure

crdt

dataManagement

paper

review
ãƒªãƒ³ã‚¯
http://learningsys.org/nips17/assets/papers/paper_22.pdf
manboubird 2018/06/10
A Machine Learning Approach to Databases Indexes

google

learnedIndex

dataStructure

deepLearning

paper

workshop

nips
ãƒªãƒ³ã‚¯
[1712.01208] The Case for Learned Index Structures
Indexes are models: a B-Tree-Index can be seen as a model to map a key to the position of a record within a sorted array, a Hash-Index as a model to map a key to a position of a record within an unsorted array, and a Bit Map-Index as a model to indicate if a data record exists or not. In this exploratory research paper, we start from this premise and posit that all existing index structures can be
manboubird 2018/06/10
google

learnedIndex

dataStructure

deepLearning

paper
ãƒªãƒ³ã‚¯
1 2 3 æ¬¡ã®ãƒšãƒ¼ã‚¸

ãŠçŸ¥ã‚‰ã›

ã‚‚ã£ã¨èªã‚€

å…¬å¼Twitter

@HatenaBookmark
ãƒªãƒªãƒ¼ã‚¹ã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“ã‚¹ã®ãŠçŸ¥ã‚‰ã›
@hatebu
æœ€æ–°ã®äººæ°—ã‚¨ãƒ³ãƒˆãƒªãƒ¼ã®é…ä¿¡

ã‚ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

jæ¬¡ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

kå‰ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

lã‚ã¨ã§èªã‚€

eã‚³ãƒ¡ãƒ³ãƒˆä¸€è¦§ã‚’é–‹ã

oãƒšãƒ¼ã‚¸ã‚’é–‹ã

è¨å®šã‚’å¤‰æ›´ã—ã¾ã—ãŸx