Cassandra at Scale: The Problem with Secondary Indexes | Pantheon.io
Pantheon recognized as Managed Hosting leader in G2 Grid® Report Learn more
Flexible In-Situ Indexing for Hadoop via Elephant Twin
This document discusses flexible indexing in Hadoop. It describes how Twitter uses Elephant-Twin, an open source library they developed, to create indexes at the block level or record level in Hadoop. Elephant-Twin allows minimal changes to jobs/scripts, indexes data without copying it, supports post-factum indexing, and indexes can be used to efficiently retrieve relevant data through an IndexedI
GiST - Wikipedia
This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (June 2015) (Learn how and when to remove this message) In computing, GiST or Generalized Search Tree, is a data structure and API that can be used to build a variety of disk-based search trees. GiST is a generalizati
FilterPushdownDev - Apache Hive - Apache Software Foundation
IntroductionThis document explains how we are planning to add support in Hive's optimizer for pushing filters down into physical access methods. This is an important optimization for minimizing the amount of data scanned and processed by an access method (e.g. for an indexed key lookup), as well as reducing the amount of data passed into Hive for further query evaluation. Use CasesBelow are the ma
Indexed Hive
This document summarizes a presentation on using indexes in Hive to accelerate query performance. It describes how indexes provide an alternative view of data to enable faster lookups compared to full data scans. Example queries demonstrating group by and aggregation are rewritten to use an index on the shipdate column. Performance tests on TPC-H data show the indexed queries outperforming the non
IndexDev - Apache Hive - Apache Software Foundation
Indexing Is Removed since 3.0There are alternate options which might work similarily to indexing: Materialized views with automatic rewriting can result in very similar results.  Hive 2.3.0 adds support for materialzed views.Using columnar file formats (Parquet, ORC) – they can do selective scanning; they may even skip entire files/blocks. IntroductionThis document explains the proposed design for
Database index - Wikipedia
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Database index" – news · newspapers · books · scholar · JSTOR (May 2024) (Learn how and when to remove this message) A database index is a data structure that improves the speed of data retrieval operati
A Diary Which Heads for Convergence (Naist branch).(2007-08-13)
テã‚スト索引パトリシア木を作り終ãˆã¦ï¼Œä»Šåº¦ã¯String B-Treeã®å®Ÿè£…ã—ã¦ã„ãŸã‚“ã ã‘ã©ï¼ŒéšŽå±¤åŒ–パトリシア木ã§ã‚‚良ã„ã®ã‹ãªã£ã¨ã‹suffix木ã®éšŽå±¤åŒ–ã®è©±ã§è‰¯ã„ã®ãŒæ案ã•ã‚Œã¦ã‚‹ã‹ã‚‚...ã¨æ°—ã«ãªã£ã¦ï¼ŒCPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequencesã¨ã„ã†è«–文をèªã‚“ã§ãŸã€‚çµè«–ã¨ã—ã¦ã¯String B-Treeã§è‰¯ã„や，ãªã‚“ã ã‘ã©ã€‚ Suffix Treeã‚’ç´ ç›´ã«ãƒšãƒ¼ã‚¸ã‚µã‚¤ã‚ºã”ã¨ã«åˆ‡ã£ã¦ï¼Œå°‘ã—工夫ã—ã¾ã—ãŸã¨ã„ã†ã‚ˆã†ãªãŠè©±ã€‚ICDE2007ãªã‚“ã ã‘ã©ï¼Œ2007å¹´ã¾ã§suffix treeã®äºŒæ¬¡è¨˜æ†¶ã¸ã®æ ¼ç´ã®è©±ãŒã‚ã‚“ã¾ã‚Šã•ã‚Œã¦ã„ãªã„ã“ã¨ã«é©šã。索引構築ã¨ä¸»è¨˜æ†¶ã«åŽã¾ã‚‹ã‚ˆã†ã«æ¥µå°è¡¨ç¾ã‚’考ãˆãŸã‚Šï¼Œä¸»è¨˜æ†¶ä¸Šã®è©±ãŒä¸»ã«ç ”究課題ã§ã‚ã£ãŸã‚ˆã†ã 。 悪ããªã„è«–æ–‡ãªã‚“ã ã‘ã©
æ ªå¼ä¼šç¤¾ã‚¹ã‚¿ã‚¤ãƒ«ã‚º
AWSアドãƒãƒ³ã‚¹ãƒ‰ã‚³ãƒ³ã‚µãƒ«ãƒ†ã‚£ãƒ³ã‚°ãƒ‘ートナーã®ä¸€å“¡ã¨ã—ã¦æ´»å‹•ã™ã‚‹æ ªå¼ä¼šç¤¾ã‚¹ã‚¿ã‚¤ãƒ«ã‚ºãŒã€AWSå°Žå…¥ã€ç§»è¡Œã€é–‹ç™ºã€ã‚»ã‚ュリティã€é‹ç”¨ä¿å®ˆãªã©ã€ã™ã¹ã¦ã®ã”相談ã«ä¹—らã›ã¦ã„ãŸã ãã¾ã™ã€‚ AWSã‚’å°Žå…¥ã—ãŸã„ãŒä½•ã‹ã‚‰å§‹ã‚ãŸã‚‰ã„ã„ã‹ã‚ã‹ã‚‰ãªã„ æ—¢å˜ã®ãƒ™ãƒ³ãƒ€ãƒ¼ãŒæ–°æŠ€è¡“ã«å¼±ãã€è‰¯ã„æ案ãŒã‚‚らãˆãªã„ クラウドã®å°Žå…¥ã«ã‚»ã‚ュリティã®ä¸å®‰ãŒã‚ã‚‹ AWSã‚’ã¨ã‚Šã‚ãˆãšå°Žå…¥ã—ãŸãŒã€ã•ã‚‰ã«æ´»ç”¨ã—ã¦ã„ããŸã„ 社内ã«AWSã®çŸ¥è¦‹ã‚’æŒã£ã¦ã„る人ãŒã„ãªã„ AWSãªã‚‰ã§ã¯ã®ã‚·ã‚¹ãƒ†ãƒ 開発を詳ã—ã知りãŸã„
R-Tree - ã“ã©ã‚‚(ã¦ã‚Œã³)
R-Tree を勉強ã—ã¾ã™ã€‚ å‚考 Rtrees: Theory and Applications ã“ã®æœ¬ã®ã‚µãƒ³ãƒ—ル pdf ãŒãŸã¶ã‚“ã‚ã‹ã‚Šã‚„ã™ã„ (chap.1, chap.2) R-Trees: A Dynamic Index Structure for Spatial Searching 原著論文 目的 与ãˆã‚‰ã‚ŒãŸçŸ©å½¢ã¨äº¤å·®ã™ã‚‹å›³å½¢ã‚’探索ã™ã‚‹å•é¡Œã‚’考ãˆã¾ã™ã€‚window query ã¨è¨€ã†ã‚‰ã—ã„ã§ã™ã€‚ã“れを効率的ã«å®Ÿè¡Œã™ã‚‹ãŸã‚ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ㌠R-Tree ã§ã™ã€‚ R-Tree ã®æ¦‚è¦ R-Tree 㯠B+-Tree ã®æ§‹é€ ã‚’ã—ã¦ã„ã¾ã™ã€‚B+-Tree ã¯ã€ leaf ã«è¦ç´ ãŒå…¥ã£ã¦ã„ã¦éž leaf ã® node ã¯æŽ¢ç´¢ã®ç‚ºã®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã®ã¿ã‚’æŒã£ã¦ã„ã‚‹ B-Tree ã§ã™ã€ãŸã¶ã‚“。R-Tree ã® leaf ã«å…¥ã‚‹è¦ç´ 㯠Minimum Bounding Rectangle (MB
空間インデックス - ma38su.sourceforge.jp
Cell method ãƒ‡ãƒ¼ã‚¿é ˜åŸŸã‚’åŒ…å«ã™ã‚‹ã‚»ãƒ«ã®ã‚µã‚¤ã‚ºã‚’事å‰ã«æ±ºå®šã™ã‚‹å¿…è¦ãŒã‚ã‚‹ãŸã‚ã€å‹•çš„ãªãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã«ã¯ä¸åˆ©ã®ã‚ˆã†ã§ã™ã€‚ å„セルã¯ã€ãã®ã‚»ãƒ«é ˜åŸŸã¨é‡ãªã‚‹é ˜åŸŸã®è˜åˆ¥åã‚’æŒã¡ã¾ã™ã€‚セルを細ã‹ã区切れã°æ¤œç´¢ç²¾åº¦ã¯å‘上ã—ã¾ã™ãŒã€ä½¿ç”¨ã™ã‚‹ãƒ‡ãƒ¼ã‚¿é ˜åŸŸãŒå¢—åŠ ã—ã¾ã™ã€‚ Digital Mapã¯Cell methodã«ã‚ˆã‚Šèªã¿è¾¼ã‚€é ˜åŸŸã‚’検索ã—ã¦ã„ã¾ã™ãŒã€ã™ã¹ã¦ã‚ªãƒ³ãƒ¡ãƒ¢ãƒªã§ãƒ‡ãƒ¼ã‚¿æ§‹é€ を構築ã—ã¦ã„ã‚‹ãŸã‚ã€ã‚»ãƒ«ã®ã‚µã‚¤ã‚ºã‚’大ããã›ã–ã‚‹ã‚’å¾—ãšã€æ¤œç´¢ç²¾åº¦ãŒã‚ã¾ã‚Šã‚ˆãã‚ã‚Šã¾ã›ã‚“。ãã‚Œã«åŠ ãˆã¦æ•°å€¤åœ°å›³25000ã«ã¯é ˜åŸŸã®å¤–接長方形ã®ãƒ‡ãƒ¼ã‚¿ã—ã‹ãªã„ã®ã§cell methodã®æ©æµã‚’ã‚ã¾ã‚Šå—ã‘ã‚‹ã“ã¨ãŒã§ããšã€åœ°å›³ãƒ‡ãƒ¼ã‚¿ã®èªã¿è¾¼ã¿ãŒé…ãã€ã¾ãŸè¡¨ç¤ºé ˜åŸŸä»¥å¤–ã®é ˜åŸŸãŒèªã¿è¾¼ã¾ã‚Œã‚‹ã“ã¨ãŒå¤šã€…ã‚ã‚Šã¾ã™ã€‚ Quad Trees é ˜åŸŸã‚’4分割（2次元）ã™ã‚‹ã“ã¨ã§æœ¨æ§‹é€ を構築ã—ã¾ã™ï¼Žãƒ‡ã‚£ã‚¹ã‚¯ä¸Šã«æ§‹ç¯‰ã™ã‚‹éš›ã«ã¯ã€2分割ã™ã‚‹ã‚ˆã‚Šã‚‚高速ã§ã™ï¼Žãƒš
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
About Indexes in Cassandra — Apache Cassandra 1.1.x documentation
[HIVE-417] Implement Indexing in Hive - ASF JIRA
DB2 Range Partitioning
Product Reviews - Watch and Diamond Reviews Here!
Dense and Sparse Indices
https://dl.acm.org/doi/10.1145/319628.319663
https://dl.acm.org/citation.cfm?id=1458174
https://dl.acm.org/doi/10.1145/564691.564753
MySQL :: MySQL 8.4 Reference Manual :: 17.6.2.2 The Physical Structure of an InnoDB Index
{{#tags}}- {{label}}
{{/tags}}