NBITSearch. Features.

502 views

Published on

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 set any functions F (S).
3. Very fast search. It allows to save time and money.

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
502
On SlideShare
0
From Embeds
0
Number of Embeds
3
Actions
Shares
0
Downloads
1
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

NBITSearch. Features.

  1. 1. Index ing and Fast Search engine NBITSearch parameters www.nbitsearch.com Novosib-BIT LLC version 1.03.3
  2. 2. 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 . .
  3. 3. The System is Designed for <ul><li>Compact indexing of huge arrays of data on a hard disk </li></ul>high-speed exact and fuzzy search for objects with minimum use of RAM . for
  4. 4. Exact and Fuzzy Search Interval queries provide fuzzy ( inexact ) search . Precise ( exact ) search is a particular case of fuzzy search .
  5. 5. Indexable Objects Objects S of any types T
  6. 6. The system indexes objects S of any types T simultaneously by a set any functions F (S) . Multifunctionality
  7. 7. Sizes of Indexable Arrays The most tangible effect in 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 indexable objects can be 1 0 ÷ 100 terabyte and larger .
  8. 8. Indexing Limitations One index supports ≈ 2 billion of its objects . Limitations of number of indexes are artificial .
  9. 9. 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 .
  10. 10. Indexing Speed Estimator : T ~ ( N ) * LOG (N) T – time of forming one index , N – number of indexable objects .
  11. 11. Compactness of Indexes A size of one index can vary within the range of 0 . 1 % ÷ 5 . 0 % of the size of indexable objects .
  12. 12. Search Speed Time estimation of defining the address of the first potential block of data : T ~ LOG (N) T – time of “logic probing” , N – number of indexed objects .
  13. 13. 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 .
  14. 14. 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 .
  15. 15. Search Speed A time of fetching the result of interval queries from a hard disk depends linearly on objects number in result set .
  16. 16. Search Memory Due to compactness of indexes the system loads each of them in RAM entirely before queries are made .
  17. 17. Search Memory A size of memory buffers to fetch the data depends on user’s needs . This size is often infinitesimal (~10 megabyte) .
  18. 18. Reading of Result Set Reading the result set from a hard disk to RAM is optimum : magnetic head does not oscillate .
  19. 19. THANK YOU ! www.nbitsearch.com Technology developed with support from FASIE formed by the Government of Russian Federation Novosib-BIT LLC © 2004 - 201 1 Patented

×