Object multifunctional indexing with an open API
Upcoming SlideShare
Loading in...5
×
 

Object multifunctional indexing with an open API

on

  • 419 views

NBITSearch is a search engine with an open API for local stations, LAN and Internet. Advantages over counterparts: ...

NBITSearch is a search engine with an open API for local stations, LAN and Internet. Advantages over counterparts:

1. Object indexing. It allows to index objects S of any types T.
2. Multifunctional indexing. It allows to index objects simultaneously by a set of any functions F (S).
3. Very fast search. It allows to save time and money.

Statistics

Views

Total Views
419
Views on SlideShare
419
Embed Views
0

Actions

Likes
0
Downloads
1
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

Object multifunctional indexing with an open API Object multifunctional indexing with an open API Presentation Transcript

  • Index ing and Fast Search engine NBITSearch parameters www.nbitsearch.com Novosib-BIT LLC
  • NBITSearch System NBITSearch is 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 . .
  • The System is Designed for
    • Compact indexing of huge arrays of data on a hard disk
    high-speed exact and fuzzy search for objects with minimum use of RAM . for View slide
  • Exact and Fuzzy Search Interval queries provide fuzzy ( inexact ) search . Precise ( exact ) search is a particular case of fuzzy search . View slide
  • Indexable Objects Objects of any types with precise ( exact , point ) parameters : Volume Weight Speed 54 175 500 100 182 700 … … …
  • Indexable Objects Objects of any types with fuzzy ( inexact , interval ) parameters : Volume Weight Speed 54 ÷ 59 175 ÷ 180 500 ÷ 600 100 ÷ 300 182 ÷ 200 700 ÷ 800 … … …
  • Indexable Objects See at www.nbitsearch.com Example :
  • Indexing of Objects At first, a user maps a source objects to the so-called primitives : precise / fuzzy parameters , piecewise functions or matrixes . Step 1 :
  • Indexing of Objects Step 2 : The system automatically transforms the primitives to numeric masks . These masks are spatial hashes of objects . Then, the system automatically indexes the masks .
  • Sizes of Indexable Arrays The most tangible effect in the speed of search is shown for such arrays of primitives , which support ≈ 50 ÷ 100 million and more objects for one index. A size of arrays of indexable objects can be 1 0 ÷ 100 terabyte and larger .
  • Indexing Limitations One index supports ≈ 2 billion of its own objects . Limitations of number of indexes are artificial .
  • What is a Billion? 1 billion seconds is ≈ 32 years . 1 billion pages for a laser printer is a pile with a height of ≈ 100 km .
  • Indexing Speed Estimator : T ~ ( N ) * LOG (N) T – time of forming one index , N – number of indexable objects .
  • Compactness of Indexes A size of one index can vary within the range of 0,1 % ÷ 5,0 % of the size of indexable objects ― primitives .
  • Search Speed Time estimation of defining the address the first potential block of data : T ~ LOG (N) T – time of “logic probing” , N – number of indexed objects .
  • Search Speed A speed of fetching the 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 .
  • Search Speed A speed of fetching the 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 operation when solving the problems with the use of brute force method .
  • Search Speed A time of fetching the result of interval queries from a hard disk depends linearly on objects number in result set .
  • Search Memory Due to compactness of indexes, the system loads each of them in RAM completely before queries are made .
  • Search Memory A size of memory buffers to fetch the data depends on user’s needs . This size is often infinitesimal (~10 megabyte) .
  • Reading of Result Set Reading the result set from a hard disk to the RAM is optimum : magnetic head does not oscillate .
  • Multidimensional of Indexes Indexes are multidimensional , but there is no an effect of “explosion” of data . Efficient indexes of objects can be formed by 1 ÷ 3 2 parameters .
  • Multifunctionality Indexes are multifunctional : Indexing and searching in the tables can be arranged by multiple virtual columns , which values are any functions of values of actual columns .
  • THANK YOU ! www.nbitsearch.com Technology developed with support from FASIE formed by the Government of Russian Federation Novosib-BIT LLC © 2004 - 2010 Patented