Abstract: A method and a system are provided for encoding and processing digital information. The digital information is encoded according to binary encoding formats corresponding to primitive data types. The primitive data types comprise scalar data types including Boolean, integer, float, decimal, time stamp, string, symbol, binary large object, and character large object data types. The primitive data types also comprise composite data types including structure, list and S-expression data types. The binary-encoded digital information is stored in a message with a predetermined format for transmission. No metadata is included in the message.

Abstract: Some examples include segmenting text of a content item to include a plurality of segments or words. For instance, a module for segmenting a content item using a context-based segmenter into a plurality of segments, identifying segment boundary hints stored in the content item, and adjusting segments of the plurality of segments based on the identified segment boundary hints. Some additional examples include inserting segment boundary hints into a content item. For instance a module that segments the content item using a first segmenter and a second segmenter and inserting segment boundary hints into the content item where the results of the first and second segmenter differ.

Abstract: Markup-language documents are converted into compacted markup-language form by using a number of parameterized macros. A parameterized macro takes at least one parameter. When compacting markup-language documents, a sequence of elements is replaced by references to a macro and to parameter(s), where the macro, when used with the parameters, yields the sequence of elements. The macros used may either be predetermined, from a static dictionary, may be generated on the fly, or mix of both. The definitions of macros may be included in the compacted markup-language information in order to allow a recipient of the compacted markup-language information to expand the macro reference and parameter(s) into the sequence of elements which had been replaced.

Abstract: A method and apparatus is disclosed for transforming hierarchical information into a rowset and for transforming a rowset into hierarchical information. In transforming hierarchical information, such as an XML data file, into a rowset, a parser parses the XML data file to form an active store. A query processor, after receiving a query including a number of metaproperties, processes data from the XML active store to form a rowset. The rowset can be processed further using a query language, such as the Structured Query Language (SQL). After processing, the rowset can be converted back into an XML data file using an XML formatter. An overflow feature facilitates the addition of text data to the rowset. A fusion feature facilitates defining a relationship between different data items in the rowset such that they can be merged into a single data element as the rowset is converted into an XML data file.

Abstract: The present invention is directed to providing a higher degree of association between nodes and links in a graph by creating data structures (spiders) that provide views into graphs that transcend the relatively static association of a conventional graph. A spider's variables bind to any number of nodes and links in the graph, enabling all of the bound nodes and links by addressing the spider. By adding constraints on the extent or degree of binding in a spider to a graph, a subset of the graph is identified. The spider can then used to address the subset of the graph as constrained by the spider. A spider can bind to a link in order to identify a parent/child structural subset of the graph. More specifically a spider is a collection of variables that create a template or pattern and bind to the nodes and links in the graph. A spider traverses a graph by binding its variables to various nodes and links in the graph.