LivCos
Everything about the LivCos project.
Images
How to best handle image/picture resources via the Web interface.
Data Sharing
Data sharing and versioning using existing technologies and tools.
 Cosmos
requirements
Namespace URIs
RFC 3986 - Uniform Resource Identifier (URI): Generic SyntaxEach URI begins with a scheme name that refers to a specification for assigning identifiers within that scheme.
Data Search
 Suffix Tree
In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many important string operations.
 Inverted index
In information technology, an inverted index (also referred to as postings file or inverted file) is an index data structure storing a mapping from content, such as words or numbers, to its locations in a database file, or in a document or a set of documents, in this case allowing full text search.
 Compound term processing
Compound terms are built by combining two (or more) simple terms, for example "triple" is a single word term but "triple heart bypass" is a compound term.
 bplusdotnet
A B+tree implementation for C#, java, and Python
 Vertical search
Vertical search, part of a larger subgrouping known as "specialized" search, is a relatively new tier in the Internet search industry consisting of search engines that focus on specific slices of content.
 List of search engines
This is a list of Wikipedia articles about search engines
/livcos.org/data/map/brainstorm/DataSearch