Search results

[[Category:Database index techniques]] ...

...arbitrary [[String (computer science)|string]] with a comparatively small index. ...ge space was related to the <math>0^{th}</math>-order entropy and that the index supports self-indexing.<ref>K. Sadakane, [https://www.academia.edu/download ...

...n-US}}</ref> BitFunnel uses bit-sliced signatures instead of an [[inverted index]] in an attempt to reduce operations cost.<ref name=":0">{{Cite book|last1= ...terms to match against. This problem is commonly solved through [[inverted index]]es, where each searchable item is maintained with a [[Map (computer scienc ...

...onal space, useful for tasks such as range-searching and multi-dimensional database queries. K-D-B-trees subdivide space into two subspaces by comparing elemen ...airs. In the case of databases, ''location'' may point to the index of the database record, while for points in ''k''-dimensional space, it can be seen as the ...

|name=Fractal tree index ...large blocks of data. The fractal tree index has been commercialized in [[database]]s by [[Tokutek]]. Originally, it was implemented as a cache-oblivious loo ...

...rformance characteristics that make it attractive for providing [[Database index|indexed]] access to files with high insert volume, such as [[transaction lo ...ganized into sorted ''runs'' of data. Each run contains data sorted by the index key. A run can be represented on disk as a single file, or alternatively as ...

...isualized using [[Environment for DeveLoping KDD-Applications Supported by Index-Structures|ELKI]]. Every blue sphere (leaf) is contained in a red sphere (d * [[Spatial index]] ...

...-and-refine algorithms for subsequence selection |conference=International Database Engineering and Applications Symposium |publisher=IEEE |year=2002 |doi=10.1 ...y across various disciplines, particularly in [[information retrieval]], [[database management]], and [[pattern recognition]], which efficiently processes larg ...

...cting its principal directions. For this purpose there are various related techniques, including: [[principal component analysis]], [[linear discriminant analysi ...dings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '01|pages=274–281|year=2001|last1=Achlioptas|first1=Dimitris ...

...nformation filtering]], [[information retrieval]], [[index (search engine)|index]]ing and relevancy rankings. Its first use was in the [[SMART Information ...ematical techniques such as [[singular value decomposition]] and [[lexical database]]s such as [[WordNet]]. ...

...n countries: unlike [[gross domestic product]] (GDP), the Inclusive Wealth Index "provides a tool for countries to measure whether they are developing in a == Inclusive Wealth Index == ...

...|''A''}} and {{math|''B''}} be subsets of {{math|''U''}}, then the Jaccard index is defined to be the ratio of the number of elements of their [[intersectio ...e similar (i.e. have relatively more members in common) when their Jaccard index is closer to 1. The goal of MinHash is to estimate {{math|''J''(''A'',''B'' ...

{{Short description|Spatial index that partitions space based on the bit-representation of keys}} ...ref name="PH-tree-2014" /> is a [[tree data structure]] used for [[spatial index]]ing of multi-dimensional data (keys) such as geographical coordinates, poi ...

...ch">{{cite journal|last1=Hirsch|first1=J. E.|date=7 November 2005|title=An index to quantify an individual's scientific research output|journal=Proceedings ...rast, if the same publications have 25, 8, 5, 3, and 3 citations, then the index is 3 because the fourth paper has only 3 citations.<ref name="hirsch"/> ...

==Techniques== ...ash values by partitioning each key into [[byte]]s, using each byte as the index into a table of random numbers (with a different table for each byte positi ...

...Trevisan|last5=Trevisan|first5=Luca|title=Randomization and Approximation Techniques in Computer Science |chapter=Counting Distinct Elements in a Data Stream |d Index := ρ(hash(x)) ...

** an [[Associative array|index]], for later branching or [[pointer (computer programming)|pointer]] [[look ...ter programming)|pointer]] using the raw data value either directly as the index to the array, or by performing some basic arithmetic on the data beforehand ...

...a_id=844&sid=1&slc_lang=en|title=Analytical stress-strain model and damage index for confined and unconfined concretes to simulate RC structures under cycli ...omputation that employs the high elaboration speed and pattern recognition techniques of computers for knowledge output from data. In other words, it is a comput ...

The [[Jaccard index|Jaccard Measure]] addresses the problem of Common Neighbors by computing th The [[Adamic/Adar index|Adamic–Adar measure]]<ref>{{cite journal |last1=Adamic |first1=Luda |last2= ...

...g 2000 IEEE Symposium on Security and Privacy. S&P 2000 |chapter=Practical techniques for searches on encrypted data |chapter-url=http://dx.doi.org/10.1109/secpr ...\mathbf{D}</math> and outputs a symmetric key <math>K</math>, an encrypted index <math>\mathbf{I}</math>, and an encrypted document collection <math>\mathbf ...