||IB 2.0 W3 (WebCat)|
BSn's interBasis IB 2.0 Webcat combines the power of the
IB 2.0 fielded fulltext search engine with a powerfull configurable form driven HTML
interface ("Webfront") designed for both the neophyte and power researcher.
- High Performance: Fast Index, Append, Modify and Search.
- Typical Indexing speed (depending upon hardware) between 200 MB to beyond 1 GB/hour
(e.g. indexing rates of 500 MB/hour measured on a 350 Mhz P-II system running Linux).
- One can quickly add new records to the database ("append") without need for
- One can quickly delete or modify records in the database without need for re-indexing.
- Excellent I/O behaviour for high TPM rates.
- Suitable for CDROM and heirarchical storage.
- Scalable from low cost PC hardware to Enterprize class server clusters.
- Designed to support Gigabytes of data.
- Does not require stopwords for indexing.
- Can Search for each and every word in a document (e.g. for searches
like "To be or not to be", "Vitamin A" or "the C++ programming
- Stopwords "may" be specified during indexing or search-- even different
lists and also dependent upon language.
- National language support.
- Multinational Character Set support.
- Supports SGML/XML and over 50 other native generic document formats.
- The structure of the document can be used to qualify the search.
- Document structure in used in most all doctypes: not just SGML or HTML.
If the document type/format has a structure (which most formats do) then
this structure is available.
- Automatic and transparent detection of implied hyperlinks.
- References, URLs,
Internet mail addresses, record links,
external containers etc.
- "On-the-fly" with late hyperlink bindings:
- Hypertext conversion and link detection occurs at runtime.
- Full HTML presentation of all document types ("on-the-fly").
- Structured Text (ASCII) presentation of all document types ("on-the-fly").
- Record-type MIME bindings to launch applications.
- State-of-the-art search models: from boolean to relevant feedback.
- Fully Fielded research.
- Boolean operators: And, Or, Not,
Xor, AndNot, Near, Before,
After, Adj and unary Not.
- Term and phrase (literal) search.
- Scan search (what some call "word wheels")
to allow users to search for "search terms" (even field level).
- User selectable term and phrase weighting.
- Phoenetic, Case dependant, Right and Left Truncated, glob and other
- "Smart" Date range search.
- RPN and Infix
notation advanced query.
- Researcher configurable number of sentences as well
as with or without advanced query input boxes
- Drag-and-drop target for fulltext Relevant Feedback.
- Field level Relevant Feedback.
- Named result sets.
- Inter-session result sets.
- User selectable sort of result sets: Chronologically or by
- Small indexes: typically requires a space overhead of less than
60% (or as little as 1/3) the size of the source.
- Workflow Aware:
- Robust Synchronous Update/Append: supports simultaneous indexing
search during indexing...
- Full access control: User, group, host, network etc.
- Year 2000 compliant? IB 2.x is Option ONE Year-2000 Compliant.
See the BSn IB 2.x Year 2000 Compliance Statement.
- Support for generic CGI as well
NaviSoft/GNNPress Web Server and
Netscape Commercial Server native APIs.
- Access also via Z39.50 protocol.
- Multi-threaded Search.
- Result caching.
- Numerical, geospatial and other object oriented searching
- More Native doctypes: support for Word Processor formats.
- More Presentation formats: RTF and other popular formats.
- Distributed objects (CORBA).
- Java aplets to support sophisticated context search.