Each chatbot subscriber will have different natural language query training database ⤵ 👈 stored and managed in the cloud by INVBAT.COM - A.I + Chatbot as service provider. So if there is no stored natural language query training database our computer algorithm will have nothing to retrieve and you will see the message "404 - Not Found".

Time to search a sorted database

In computer science using the ordinary binary search to find a certain record in a sorted database, how long will it take? Answer: The binary search will do comparison operation in roughly Log ₂ N . It means if the table has N = 1,000,000 record, then to find a certain record it will take 20 comparison operations. How many millisecond each comparison? ( assuming it is 10 millisecond to read a record on a disk ) then 20 x 10 millisecond = 200 ms or 0.2 second to find and display the query record. Log ₂ 1,000,000 = 19.9 or 20 comparison to find the record. 1,000,000 is also equal to 1e6 when written in exponential notation.

In 1972 B-Tree was invented by Rudolf Bayer and Edward M. McCreight while working at Boeing Research Lab. In computer science, B-Tree is a self balancing tree data structure. Compare to self-balancing binary search trees, the B-Tree is optimized for systems that read and write large blocks of data. B-Trees are a good example of a data structure for external memory. B-Tree data structure is commonly used in databases and filesystems. --source : Wikipedia

Log _b N is the optimize way of doing binary search using B-Tree. Where b is the blocking factor, meaning if you divide your sorted 1,000,000 records by 100 blocks, you can optimize your binary search capability . Log ₁₀₀ 1,000,000 = 3 reads . Then 3 reads x 10 milliseconds = 30 milliseconds.--source : Wikipedia

IBM Cloudant NoSQL document database , MapReduce views are indexes into the dataset with key value pairs and stored in a B-Tree for efficient retrieval by key or range of keys.

Any base Logarithm Log ₂ (32) = 5 for example
For base 100 , change 2 to 100
Log ( ) =

Common logarithm is base 10. Base 10 here is shown as a reminder.

Log ₁₀ (1000) is commonly written as Log (1000 ) = 3

Log ₁₀ =

Natural Logarithm (e = 2.718)
Ln _e =

Reviewer

IN-V-BAT-AI uses explainable Artificial Intelligence (AI) to automate repetitive solved problem so we can focus our brain power to solve harder new problem then automate again once it is solved.

Click here for chatbot subscription ⤵ 👈

INVBAT.COM - A.I. + CHATBOT SERVICE
USED IN 207 COUNTRIES

organic growth - no marketing budget

INVBAT.COM - A.I. is a disruptive innovation in computing and web search technology. For example scientific calculator help us speed up calculation but we still need to remember accurately the formula and the correct sequence of data entry. Here comes the disruptive innovation from INVBAT.COM-A.I. , today the problem of remembering formula and the correct sequence of data entry is now solved by combining formula and calculation and make it on demand using smartphone, tablet, notebook, Chromebook, laptop, desktop, school smartboard and company big screen tv in conference room with internet connection.

How to improve memory recall

Copyright 2022 INVBAT.COM - A.I. + Chatbot
The Personal Memory Assistant Company

INVenting Brain Assistant Tools using Artificial Intelligence
(IN-V-BAT-AI)