Multidimensional Indexing: Spatial Data Management & High Dimensional Indexing.
Object multifunctional indexing with an open API
-
Upload
akvalex -
Category
Technology
-
view
335 -
download
3
description
Transcript of Object multifunctional indexing with an open API
![Page 1: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/1.jpg)
Indexing andFast Search
engine
NBITSearchparameters
www.nbitsearch.com
Novosib-BIT LLC
version 1.03.3
![Page 2: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/2.jpg)
NBITSearch System
2
NBITSearchis a search engine with an open API.
---------------------------
NBITSearch is a programme kernel for
― Database Management Systems, -
― Warehouses of Large Data, -
― Search Systems applied to any Objects..
![Page 3: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/3.jpg)
The System is Designed for
Compact indexing of hugearrays of data on a hard disk
3
high-speed exact and fuzzy search for
objects with minimum use of RAM.
for
![Page 4: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/4.jpg)
4
Exact and Fuzzy Search
Interval queries provide
fuzzy (inexact) search.
Precise (exact) search is a particular case of fuzzy search.
![Page 5: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/5.jpg)
5
Indexable Objects
Objects Sof anytypes T
![Page 6: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/6.jpg)
6
The system indexesobjects S
of any types Tsimultaneously
by a setany functions F (S).
Multifunctionality
![Page 7: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/7.jpg)
7
Sizes of Indexable Arrays
The most tangible effectin the speed of search is shown
for such arrays of objects,which support
≈ 50 ÷ 100 million and more objects for one index.
A size of arrays of indexableobjects can be
10 ÷ 100 terabyte and larger.
![Page 8: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/8.jpg)
8
Indexing Limitations
One index supports≈ 2 billion ofits objects.Limitations
of number of indexes are artificial.
![Page 9: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/9.jpg)
9
What is a Billion?
1 billion seconds is≈ 32 years.
1 billion pagesfor a laser printer is
a pile with a height of ≈ 100 km.
![Page 10: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/10.jpg)
10
Indexing Speed
Estimator:
T ~ (N) * LOG (N)
T – time of forming one index,N – number of indexable objects.
![Page 11: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/11.jpg)
11
Compactness of IndexesA size of one index
can varywithin the range of
0.1 % ÷ 5.0 %
of the sizeof indexable objects.
![Page 12: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/12.jpg)
12
Search Speed
Time estimationof defining the address of the first
potential block of data:
T ~ LOG (N)
T – time of “logic probing”,N – number of indexed objects.
![Page 13: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/13.jpg)
13
Search Speed
A speed of fetchingthe result of interval queries
from a hard disk can be
10 ÷ 100 times higher than (for the large data array),
the speed of similar operation in a standard relational DBMS.
![Page 14: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/14.jpg)
14
Search Speed
A speed of fetchingthe result of interval queries
from a hard disk can be
1000 times (and more) higher than(for the large data array),
the speed of similar operationwhen solving the problems
with the use of brute force method.
![Page 15: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/15.jpg)
15
Search Speed
A time of fetching the result of interval queries
from a hard disk
depends linearly
on objects number inresult set.
![Page 16: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/16.jpg)
16
Search Memory
Due tocompactness of indexes
the system loads each of them
in RAMentirely
before queries are made.
![Page 17: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/17.jpg)
17
Search Memory
A sizeof memory buffers
to fetch the data dependson user’s needs.
This size is often infinitesimal(~10 megabyte).
![Page 18: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/18.jpg)
18
Reading of Result Set
Reading
the result setfrom a hard disk
to RAM
is optimum:magnetic head does not oscillate.
![Page 19: Object multifunctional indexing with an open API](https://reader033.fdocuments.in/reader033/viewer/2022042614/55509954b4c9058b208b4817/html5/thumbnails/19.jpg)
19
THANK YOU!
www.nbitsearch.com
Technology developed with support from FASIEformed by the Government of Russian Federation
Novosib-BIT LLC © 2004 - 2010Patented