Abstract: Methods, systems, and computer-readable media for global column indexing in a graph database are disclosed. A plurality of data elements of a graph database are stored. The triples comprise identifiers, column names, and values. The column names are globally scoped in the graph database and are associated with data types. Indices corresponding to the column names are created. A particular one of the indices comprises one or more of the values associated with the corresponding column name. A query is performed on the graph database using one or more of the indices corresponding to one of more of the column names associated with the query.

Abstract: Methods and systems for indexing content in a cache data structure within a content cache are disclosed. The methods and systems identify at least one characterization data associated with a received content request and input the at least one characterization data into a hash function to generate an index that is used for identifying an entry associated with the requested content in the cache data structure. The at least one characterization data may include a portion of content associated with the received content request, a portion of a Uniform Resource Locator (URL) associated with the received content request, an IP address associated with the received content request, the length of the content associated with the received content request, and one or more parameters parsed from the URL associated with the received content request.

Abstract: A computer-implemented method, computer-readable media, and a computerized system to compress words are provided. The computerized system includes a compression engine that compresses a list of words. The compression engine generates a symbol list from the list of words, decomposes the words using the symbol list and a cost function, and encodes the decomposed words. The words may be from a search index. The compression engine may be utilized to reduce the size of the search index and improve efficiency.

Abstract: A system for interactive paper is described. Data fragments are captured at locations in a rendered document. A digital version of the document is optionally located. Markup data applied to the capture creates a rich set of interactions for the user. New models for publishing documents and new document-related services are described.

Abstract: A system and a method for linking textual and physical concepts are disclosed. The method includes extracting candidate phrases from a knowledge base for a device, the candidate phrases including noun phrases. A set of candidate concepts is generated, based on the extracted noun phrases. Provision is made, e.g., on a graphical user interface, for a user to generate mapped concepts for physical components of the device by selecting, for each concept to be mapped, a physical component shown in a graphical representation of the device and at least one of the candidate concepts which is to be linked to that physical component. The knowledge base is indexed, based on the mapped concepts. In this way, textual expressions in the knowledge base are linked to a respective physical component through one of the mapped concepts.

Abstract: Systems, methods, and computer-readable storage media are provided for column-oriented storage in a row-oriented database management system. Data may be provided in one or more columns, each datum associated with a position within a column. A list may be created of one or more records per column, each record including a plurality of values stored in an order of position within the column and a first positional indicator. An index may be created to access a value stored in a record, wherein the index includes an index parameter derived from each record in the list and the index parameters are ordered in accordance with an order of records in the list.

Abstract: An approach is provided for generating a searchable index including an associated object graph. Data objects of a database are converted into corresponding rows in a set of searchable columns. An object graph corresponding to each row of the searchable columns are determined. An index including the set of searchable columns and the corresponding object graphs are generated.

Abstract: A system and method for providing a user with efficient access to a log data file. The system takes a computer generated log data file and applies a user defined filter criteria to the log data file. The indexed and filtered log data file is then displayed to the user in an application player where the user can interact with the log data file.

Abstract: A computing system can archive information from internetworked computers, such as Internet content, for later retrieval. A server system processes content providers, such as DNS registries and web sites, to extract and store content, including text, image, audio, and video content. For web sites, HTML source code is stored along with a browser-rendered display file. The content is perpetually archived to create a historical record of information for each content provider. An interface is used to retrieve the archived content in response to queries.

Abstract: Systems and methods for compressing an index are described. In one exemplary method, the results of a search are annotated and then encoded into one or more chunks of compressed data in accordance with the annotations of the results. The annotations include an indication of a best encoding method selected from a set of available encoding methods, and an indication of whether to switch to a new chunk during encoding or to continue encoding in the current chunk. Other methods are described and data processing systems and machine readable media are also described.

Abstract: A recording medium stores a program that causes a processer to execute a procedure. The procedure includes: calculating registration positions of data based on a total amount of data of existing tables and a hash method, and registering the data at the registration positions, when registering the data in a plurality of tables; adding or deleting a table from the plurality of tables; calculating the registration position of the data based on the total amount of data of the existing tables and the hash method and judging whether data to be referred to is present at the registration position, when data registered in a table is referred to after the table is added or deleted; and when the data to be referred to is not present at the registration position, recalculating the registration position of the data.

Abstract: The present invention relates to a method of generating a distributed text index for parallel query processing by a number of nodes. A set of node indices is generated for text indexing a set of documents, each node text index covering a subset of the documents. For each node text index, a local frequency measure for each term of the node text index is calculated on the basis of a frequency of documents containing the term in the subset of the documents of the node. A global frequency measure for each term is calculated on the basis of a frequency of documents containing the term in the set of documents. A quality measure for each node text index is calculated on the basis of the local frequency measures of the terms of the node and the global frequency measure of the terms of the node.