Overview
The technology that enables CeleriQ to display results extremely quickly while at the same time also calculating all possible non-empty paths is a special indexing engine built around a metabase. A metabase is different than a database in that the data is tagged with metadata that is used in searches in conjunction with the actually data. This has the effect of optimizing for time. CeleriQ organizes information in such a way that ensures queries cannot return information that will lead to an empty set of data on the next query. In traditional SQL programming you can do this by performing all of the queries up front, of which there may be thousands or millions, to determine what is displayed to users. In many instances this is an unworkable solution.
Conventional relational databases use set theory to group data in such a way as to optimize space and provide a SQL language to get data. It is easy to use for software developers but not for non-technical people. A software developer must first build an application for which he has the requisite skills and ease of use comes second. Applications of moderate or extreme complexity may not be able to handle the way in which users interact with it. CeleriQ allows applications to be constructed in such a way as to provide a user with defined paths of query. The software developer does not have to provide all possible navigation paths, which may number in the hundreds or thousands.
Difference
CeleriQ can calculate with exact precision all possible, valid paths a user can take. This is very useful in the Internet listing space. In a traditional listing website, the user can narrow results by choosing some feature, specification, or data to limit a huge result set to a much smaller one. A very common result of this design is that the user either gets far, too many results or an empty result set. Many site users will think an error has occurred or just lose interest and go to another site.
This is one of the issues addressed by CeleriQ. The engine reports only results that have some meaning in the next search. Using Piloted Search, a data set of cars that happens to contain multiple Ford automobiles but no Toyotas in Kansas should never display a Toyota link if the user has already narrowed results by the state Kansas. That sounds very simple, however with SQL programming one would have to run a query and check all car makes against the data set before painting the screen.
The engine uses advanced graph theory, set theory, and non-relational data organization to provide lightning quick results with all possible future paths resolved before the queried result set is returned. This Forward-Knowledge technology provides applications with the ability to provide useful results to users.
Follow this link to view a detailed explanation of a sample site page. It highlights many of the features that come right out of the box.
