Abstract: In one embodiment, real-time adaptive binning may be performed through the modification of a set of partitions. More particularly, a set of partitions separating one or more bins from one another may be identified, each of the one or more bins having boundaries including a lower boundary and an upper boundary, wherein the boundaries of the one or more bins together define a contiguous range of data values capable of being stored in the one or more bins. A data value may be obtained and added to one of the one or more bins according to the boundaries of the one or more bins. It may be determined whether to modify the set of partitions. The set of partitions may be modified according to a result of the determining step.

Abstract: An aggregated file is generated, by storing a plurality of initially provided files in a sequence. A computational device executes a first set of compression operations on each of the plurality of initially provided files to generate a plurality of compressed files that replace the plurality of initially provided files, wherein starting locations of the plurality of compressed files and the plurality of initially provided files are identical, and wherein predetermined bit patterns are stored in empty spaces that follow each of the plurality of compressed files. The computational device sends the aggregated file to a linear storage device configured to perform a second set of compression operations on the aggregated file.

Abstract: A method and apparatus implementing a “hadron” data structure architecture. In some embodiments, each hadron includes a frame identifier and a holder for a payload of data, wherein the plurality of hadron data structures are stored in a hadron block that provides a specification that includes metadata that specifies the payload. Some embodiments include a plurality of hadron blocks first and second hadron data blocks, each block including one or more hadron pages. Upon receiving data particles of a dataset, the system forms a first plurality of hadron data structures (hadrons) by creating a first frame identifier and associating the first frame identifier with a first data particle to form the first hadron, and creating a second frame identifier and associating the second frame identifier with a second data particle to form the second hadron, and stores the first plurality of hadron data structures in the first hadron page.

Abstract: Systems and methods for storing and retrieving data elements transmitted via data streams received from distributed devices connected via a network. The received data elements may be stored in block stores on the distributed devices. The stored data-elements may be allocated to data-blocks of a block-store that have assigned block-identifiers and further allocated to events of the data-blocks that have assigned token-names. Stream-schema of the received data-streams may comprise a list of token-names and an index-definition for each corresponding data-stream. Indices may be generated for the event-allocated data-elements. A query may be executed in order to retrieve data-elements of the received data-streams based on the indices.

Abstract: A system and method for storing data-files stored on distributed devices connected to a network. Data-elements of the data-files are allocated to data-blocks stored on the distributed devices. Key-identifiers are calculated for each of the data-blocks based on the allocated data-elements. The key-identifiers are stored in distributed tables stored on the distributed devices. Index-nodes are generated for the data-files based on the data-blocks. A Paxos algorithm is executed for the index-nodes based on the key-identifiers to provide a consensus of the data-files that are stored on the plurality of distributed devices.

Abstract: A method for building and maintaining centralized and harmonized relational database for acquiring, managing, filtering, integrating and accurately analyzing peptide and protein data based on functional class is described. In addition, a computer-based system comprising the above database and analysis tools for mining and analyzing the protein/peptide data stored in the database is provided. The database is built using curated and validated protein specific data and does not rely on probabilistic or predictive approaches to derive protein information indirectly from genomic or gene-expression data.

Abstract: For automatic data placement of database data, a plurality of access-tracking data is maintained. The plurality of access-tracking data respectively corresponds to a plurality of data rows that are managed by a database server. While the database server is executing normally, it is automatically determined whether a data row, which is stored in first one or more data blocks, has been recently accessed based on the access-tracking data that corresponds to that data row. After determining that the data row has been recently accessed, the data row is automatically moved from the first one or more data blocks to one or more hot data blocks that are designated for storing those data rows, from the plurality of data rows, that have been recently accessed.

Abstract: A mechanism is provided in a collective acceleration unit for performing a collective operation to distribute or collect data among a plurality of participant nodes. The mechanism receives an input collective packet for a collective operation from a neighbor node within a collective tree. The input collective packet comprises a tree identifier and an input data field and wherein the collective tree comprises a plurality of sub trees. The mechanism maps the tree identifier to an index within the collective acceleration unit. The index identifies a portion of resources within the collective acceleration unit and is associated with a set of neighbor nodes in a given sub tree within the collective tree. For each neighbor node the collective acceleration unit stores destination information. The collective acceleration unit performs an operation on the input data field using the portion of resources to effect the collective operation.

Abstract: An index of data elements is stored with a file. The file encodes the data elements. The index indicates memory locations of the data elements within the file. The index and the file are stored in a storage device. A parser or decoder accesses the index to identify data elements. At least one of the storing and accessing are performed by a computing device.

Abstract: A method for compressing index pages in a database system is provided. The database system includes a table, and the table includes table columns. The method includes: providing an index associated with the table, wherein the index is stored on at least one index page of the database system, and wherein the index comprises index columns related to a part of the table columns; providing a first sequence of the index columns; providing a second sequence of the index columns; arranging the index columns stored on the at least one index page according to the second sequence; performing a prefix compression on entries of the at least one index page; and accessing the index using the first sequence of the index columns.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving installation data, the installation data corresponding to one or more applications that can be installed and executed on mobile computing devices, receiving metadata corresponding to each of the one or more applications, for each application: generating a time series based on a number of installs, processing the time series and the metadata, calculating a score, determining that the score is greater than or equal to a threshold score, and in response to the determining, adding the respective application to an index of trending applications, storing the index of trending applications in computer-readable memory, retrieving the index of trending applications, and transmitting indications of one or more applications for display based upon the index of trending applications.

Abstract: In one embodiment, a method receives a plurality of documents. The documents may be received from different medical providers. Also, the documents may be medical record documents generated or captured in a first format and a second format. The first format may be an unstructured data format and the second format may be a structured data format. The first and second documents are then converted to a common format. For example, a common format may emerge as the most restrictive or constrained denominator of the first format and the second format. A schema is determined that provides an organizational structure with categories that can be used to index the content of the first and second documents while they are being converted to the common format. The schema and indexing enable the different formats of documents to be combined and organized simultaneously into a single view for a comprehensive review.

Abstract: A cleaning application that can clean at least one of one or more files and a registry of a computer is provided. The cleaning application can be remotely deployed over a network to one or more computers. The cleaning application can include an administrator cleaning module and a user cleaning module. The administrator cleaning module can automatically scan a network and detect one or more computers. The administrator cleaning module can then remotely deploy the user cleaning module to one or more selected computers of the network. Once the user cleaning module is deployed on a computer, the administrator cleaning module can remotely manage the user cleaning module over the network. In particular, the administrator cleaning module can instruct the user cleaning module to clean at least one of one or more files and a registry of the computer.

Abstract: An approach is provided for providing distributed key range management. A key management platform determines to rebalance a node for storing a key value range by splitting at least one other node from the node, wherein the at least one other node stores at least a portion of the key value range. The key management platform also causes, at least in part, a creation of one or more node lists for the node, the at least one other node, or a combination thereof. The key management platform further causes, at least in part, a storage of the one or more node lists at the node and the at least one other node, wherein any one of the one or more node lists can be used to initiate a routing of one or more requests between the node and the at least one other node to operate on the key value range.

Abstract: Methods, systems, apparatus, and computer storage mediums for receiving an initial index, the initial index associating each application of one or more applications with one or more applications of interest; for each application, receiving metadata associated with the application and receiving metadata associated with each of the one or more applications of interest; processing the metadata to selectively remove at least one of the one or more applications of interest from the initial index to provide a final index, the final index associating each application of the one or more applications with a remaining one or more applications of interest; storing the final index in memory; receiving a user selection of a particular application of the one or more applications; retrieving the one or more applications of interest based on the particular application using the final index; and providing the one or more applications of interest for display.

Abstract: When multiple types of monitored objects are sorted into main monitored objects and smaller objects accommodated therein, the states of the smaller objects can be made searchable by only monitoring information about said main monitored objects. The event information management system is provided with: an association information storage unit which stores association information in which association lists comprising main monitored object IDs and subordinate monitored object IDs associated therewith are marked with specific list identifiers; an event management module which, if the attribute information of an input event shows a physical quantity, selects the list identifiers of the association lists containing main monitored object IDs matching the entity ID of said input event, and creates index information in which the list identifiers and the input event attribute information are associated; and an index storage unit which stores the index information for purposes of searching for events.

Abstract: A new approach is proposed that contemplates systems and methods to provide query suggestions including real-time suggestion of complete query terms, which can be phrases, to a user by analyzing and indexing the real-time history/stream of content or documents in addition to the stream of queries entered. Since the real-time indexing generates a count of potential results for each term found and/or indexed in the stream, the terms found in that stream can then be used as potential query suggestions, knowing that it will be possible to provide results for those queries.

Abstract: Methods, systems, and computer program products for searching clinical terminology databases, and more specifically systems and methods for searching structured terminology databases that possess structures for terminology synonyms and semantic parent concept relationships—such as the Systematized Nomenclature of Medicine—Clinical Terms (SNOMED CT) data standard—are provided. This involves interfacing with the database using an application program interface to enable communication between the database and a search module, and searching the database using the search module to generate an ordered list of database records by defining a search string, retrieving database records from the database by matching terms associated with concepts in the database to the search string, and retrieving the database records for the concepts associated with the matched terms. The retrieved results can be ordering based upon a relevancy criterion.

Abstract: A monitoring status display device according to the present invention has: use index number determination means for, when displaying an arrangement of indices representing monitoring subjects in a predetermined display region, determining use index numbers that can be used with respect to importance levels set for the monitoring subjects, based on a ratio of the importance levels and a total number of the indices; importance level allocation means for determining an index to be allocated to each of the importance levels, based on the arrangement of the indices and the use index numbers set for the respective importance levels, in a manner that indices with the same importance level are disposed close to each other; and monitoring subject allocation means for allocating, substantially evenly to the indices, the monitoring subjects having an importance level same as that of the indices.

Abstract: A method, system and computer program product for monitoring a heap in real-time to assess the performance of a virtual machine. A mobile agent is created to be preloaded with boundary settings for each heap metric. Boundary settings are thresholds that are used to diagnose the effectiveness of operation of the heap. The mobile agent is deployed onto an application server to monitor the effectiveness of operation of the heap of a virtual machine within the application server. If a boundary setting for one of the heap metrics is exceeded, then the mobile agent determines whether a non-critical, a critical or a fatal error has occurred. An appropriate response is then performed. By monitoring the heap in real-time, undesirable behavior characteristics of the heap can be detected early thereby allowing remedial actions to be enacted to address such problems before those problems escalate into more serious problems.

Abstract: An index data configuration adapted to a code-string search method for a structured code string having data codes, first separator codes that separate a data code or a data code string and second separator codes that divide a code string into partial code strings. The configuration has a code ID range table holding the code ID ranges for each code and a next code ID table holding next code IDs. Using the configuration, a partial code string is searched for in the search target code string by a first search code string consisting of the data code or the data code string and a first separator code. Next, using a second search code string consisting of first separator codes, the data code or the data code string separated by each of the first separator codes is searched from the found partial code string.

Abstract: Apparatuses, systems, and processes provide remote access to virtual objects abstracted from an electronic document. A publisher's electronic document is abstracted into its component virtual objects that are each, in turn, identified. Corresponding computer readable files are formed for respective virtual objects and the computer readable files are indexed. The index is encoded in a non-transitory computer readable medium. Users annotate the virtual objects and the annotations and corresponding annotation metadata are indexed and encoded in the non-transitory computer readable medium. The user annotations are shared amount a plurality of users.

Abstract: Embodiments of the invention relate to evaluation and storage of data in a computer system configured with a shared pool of resources. A multi-level adaptive compression technique is employed to minimize the cost of data storage based upon the type of data being stored and their access pattern. The costs of data storage include capacity, bandwidth, and compute cycles. Data is transformed local to a client in communication with the shared pool, local to the shared pool, or as a combination with a partial transformation local to the client and a partial transformation local to the shared pool.

Abstract: A document analysis device (1) comprises a common assessment information selection unit (90) and an event impact analysis unit (100). The common assessment information selection unit (90) identifies information that matches second assessment information that appears in event-related documents which include descriptions concerning a designated specific event, from among first assessment information that appears in documents for analysis which include descriptions relating to items for analysis, and classifies the information thus identified as common assessment information.

Abstract: According to one embodiment of the present invention, a method for dictionary encoding data without using three-valued logic is provided. According to one embodiment of the invention, a method includes encoding data in a database table using a dictionary, wherein the data includes values representing NULLs. A query having a predicate is received and the predicate is evaluated on the encoded data, whereby the predicate is evaluated on both the encoded data and on the encoded NULLs.

Abstract: A method provides computerized searching of a data set. A method determines the location of an item in a contiguous data set including a plurality of items, the data set is stored in a computer system, and the method assigns a numeric value to each of the plural items in the data set. A least squares polynomial may be created for the data set using ordered pairs of (x, y), wherein x is the assigned numeric value of the item the data set and y is the location of the item in the data set. A command is received to search for the location of a target item in the data set, and a calculated target item location in the data set is generated using a target item assigned numeric value and the least squares polynomial.

Abstract: Systems and methods are disclosed for a cache-sensitive index that uses fixed-size partial keys. The index may include a node comprising a child group pointer, a number of partial keys and a similar number of full-key pointers. The node may also include a record count. The nodes are organized into groups. The groups may contain a number of nodes one greater than the number of partial keys in a node and the nodes in a group may be stored contiguously in memory. The child group pointer and the number of partial keys may fit within a cache line. A method is disclosed for traversing the index, for bulk-loading the index, and for live deletion of records from the index.

Abstract: A data structure. The data structure includes a record containing data, a record identifier associated with the record, a user identifier associated with the record, and a linking identifier containing the record identifier of a single record with which the linking identifier is associated and the user identifier associated with the record.

Abstract: Techniques are provided for dynamic configuration of search parameters for multimedia fingerprint databases that use weak bits. A multimedia fingerprint database, which stores reference fingerprints and uses weak bits, is maintained. Maintaining the database includes dynamically configuring one or more of the following parameters: a fingerprint length of those portions of the reference fingerprints that are used to identify multimedia objects; an index length of the index used to index those portions of the reference fingerprints that are used to identify multimedia objects; a threshold that is used to determine whether multimedia objects are correctly identified; and a number of the weak bits in the reference fingerprints.

Abstract: Subject matter described herein includes a multi-layer search-engine index. Accordingly, the search-engine index is divided into multiple indexes, each of which includes a respective set of information used to serve (i.e., respond to) a query. One index includes a term index, which organizes a set of terms that are found among a collection of documents. Another index includes a document index, which organizes a set of documents that are searchable. A computing device is used to serve the search-engine index (i.e., to analyze the index when identifying documents relevant to a search query). For example, a solid-state device might be used to serve the multi-layer search-engine index.

Abstract: In one embodiment, a method includes maintaining access to information comprising nodes and edges; receiving a request from a first user corresponding to a first user node for a structured document corresponding to a first concept node; determining a first data set that identifies concept nodes connected by edges with user nodes that are each connected by edges with both the first user node and the first concept node; determining a second data set that identifies concept nodes connected by edges with the first concept node and user nodes that are each connected to the first user node; generating a score for each concept node in the data sets; selecting one or more concept nodes based on their scores as recommended nodes; and transmitting to the client device the structured document and code executable by a client application to render node names or identifiers of the recommended nodes for display.

Abstract: A forward compatibility guaranteed data compression and decompression method and apparatus are provided. The compressed data decompression apparatus includes a compressed file parsing unit which parses a compressed file comprising compressed data, a header including information on the compressed data and an extension field to extract the compressed data, and an original file generating unit which decompresses the compressed data to generate an original file. The extension field includes one or more extension field units and an extension field terminating code indicating an end of a region capable of including the extension field units, each of the header and the extension field units starts with a data identification code having the same number of bytes, and the extension field unit further includes its own length data separated by a predetermined number of bytes from its own data identification code.

Abstract: A complete document management system is disclosed. Accordingly, systems and methods for managing data associated with a data storage component coupled to multiple computers over a network are disclosed. Systems and methods for managing data associated with a data storage component coupled to multiple computers over a network are further disclosed. Additionally, systems and methods for accessing documents available through a network, wherein the documents are stored on one or more data storage devices coupled to the network, are disclosed.

Abstract: A computer-based method for character string matching of a candidate character string with a plurality of character string records stored in a database is described. The method includes performing a clustering operation on at least a portion of the plurality of character string records, the clustering operation generating a plurality of clusters, each cluster comprising a plurality of character strings from the plurality of character string records, the plurality of character strings in each cluster are determined to be similar with respect to each other based on at least one characteristic of the plurality of character strings. The method also includes generating a set of reference character strings that are selected from the plurality of character strings in each cluster, generating an n-gram representation for one of the reference character strings in the set of reference character strings, and generating an n-gram representation for the candidate character string.

Abstract: Technology for semantic compression is disclosed. In various embodiments, the technology receives data that represents one or more physical attributes sensed by one or more sensors; employs at least one pattern or statistical feature to identify a first region and a second region in the received data; computes a first utility and a first relevant feature for the first region, and a second utility and a second relevant feature for the second region; and identifies based on at least the first utility and the second utility a first compression method to apply to the first region and a second compression method to apply to the second region wherein the first and the second compression methods have different compression rates, different feature preservation characteristics, or both.

Abstract: Optimizing the execution of a query in a multi-database system includes identifying a region within a table, the table being referenced in the query. The region is stored on data-storage devices on first and second system databases in the multi-database system. A first access plan for the query is developed, the first access plan comprising accessing the version of the region stored on the first system database. A second access plan for the query is developed, the second access plan comprising accessing the version of the region stored on the second system database. A selection is made between the first access plan and the second access plan to execute the query. The query is executed using the selected access plan to produce a result.

Abstract: Embodiments of the present invention relate to systems and methods for determining sets of products which are similar to each other in terms of consumers' wants and needs. Queries are performed on a particular product. Documents relating to the query are received and stored. A dictionary is created from the received documents, whereby the documents, which are text files, are scrubbed of certain data to create a scrubbed text file. Topic modeling is then performed on the cleansed text file. Various methods can be used to perform topic modeling, including, but not limited to, latent semantic analysis, nonnegative matrix factorization, and singular value decomposition.

Abstract: Technology for adaptive compression is described (“the technology”). The technology may identify two or more partitions of a data stream; optionally pre-process data in each partition; create one or more evaluation functions to evaluate a suitability for compression of the data in each partition using a set of potential compression methods; process the created one or more evaluation functions; choose a subset of the set of potential compression methods for each segment at least partly by analyzing the evaluation functions; select a compression method for each segment based on a compression ratio of compressing the sequence of used compression methods and a compression rate of the data; compress the data in each partition using the selected compression method for the partition; compress a subsequence that indicates which compression method is used for each segment.

Abstract: Systems and methods are provided for file searching on mobile devices. A system includes a user interface and a file query system. The user interface is for receiving a user-provided spatio-temporal query for use in searching for a particular file. The user-provided spatio-temporal query is provided by a user of a mobile device. The file query system is for determining information about the particular file responsive to the user-provided spatio-temporal query, and identifying from the information one or more files as a search result for the particular file.

Abstract: Systems and methods for efficiently processing electronically stored information (ESI) are described. The systems and methods describe processing ESI in preparation for, or association with, litigation. The invention preserves the contextual relationships among documents when processing and indexing data, allowing for increased precision and recall during data analytics.

Abstract: It is an object to provide a data collection system that is configured to reduce a communication amount, etc. at the time when data are collected from devices, so as to reduce a communication amount attended by the collection of data without increasing processing loads imposed on devices. The data collecting device comprises a code operating means for deriving a frequency of the symbol for each symbol corresponding to the code being contained in the already compressed data based upon the data analysis result being contained in the received already compressed data, and a code operation developing means for adding the frequency of the description format, out of the frequencies obtained by the code operating means, to the frequency of the basic symbol corresponding to the above description format, and adding the frequency of the derivative symbol to the frequency of each basic symbol constituting the derivative symbol.

Abstract: A query that identifies an input data source is received. The input data source is partitioned into a plurality of partitions. Each of the partitions includes a set of data elements with an associated set of indices for indicating an ordering of the data elements. A query type for a query operator in the received query is identified. It is determined whether a reordering of data elements will be performed based on the identified query type. The data elements in at least one of the partitions are reordered when it is determined based on the identified query type that reordering will be performed.

Abstract: An embodiment of a method includes receiving a selection of an original content item, deriving a supplemental content item from the original content item, designating a unique identifier to the supplemental content item, and inserting a reference including the unique identifier into the primary document. A system includes a candidate content item repository having one or more content items that can be included in a structured electronic document, a copy module configured to derive a base supplemental content item from a selected one of the candidate content items and further configured to designate a unique identifier for the base supplemental content item, and a document editor configured to receive the unique identifier and insert the unique identifier into a reference to the base supplemental content in the primary document.

Abstract: Disclosed herein is a data processing apparatus including: a data sort block configured to sort, into multiple groups by information data of a same type, input data including information data of multiple types formed by multiple bits; a maximum value extraction block configured to extract a maximum value of the information data in each of the groups sorted by the data sort block; and a bit position decision and bit reduction block configured to determine a reduction position of bits common to the information data of the same type in each group on the basis of the maximum value extracted by the maximum value extraction block and reduce the common bits in accordance with the determination.

Abstract: The invention relates to a method for compressing identifiers of program code elements in a portable data carrier, to a method for calling compressed identifiers, to a portable data carrier, and to a semiconductor chip having a memory area for storing the compressed identifiers.

Abstract: Methods and systems for serving documents are provided. Documents may be served to users, for example, in response to search query inputs. Documents may be individually received for serving to users. In order to serve documents, documents are typically indexed. To serve documents in a real-time environment, a data structure is configured to index documents that are received while simultaneously being queried for documents to serve to a user. Documents that have not yet completed the indexing process are not available for serving and, thus, are not queried. Additionally, the data structure includes a memory optimizer such that indexing does not waste memory of the data structure.

Abstract: The present invention discloses a method for storing index information. The method includes: after storing a content, sending index information pointing to the stored content to index nodes in an aggregation network that belong to the same geographical area as the stored content for storing; and sending the index information pointing to the stored content to index nodes in a core network for storing. The present invention also discloses a method for searching for index information, an apparatus for storing index information, an apparatus for searching for index information, and a communication network system.

Abstract: System and Methods for non-uniform memory (NUMA) garbage collection are provided. Multiple memories and processors are categorized into local groups. A heap space is divided into multiple pools and stored in each of the memories. Garbage collection threads are assigned to each of the local groups. Garbage collection is performed using the garbage collection threads for objects contained in the pools using the garbage collector threads, memory, and processor assigned to each local group, minimizing remote memory accesses.

Abstract: A method and apparatus for using network traffic logs for search enhancement is disclosed. According to one embodiment, network usage is tracked by generating log files. These log files among other things indicate the frequency web pages are referenced and modified. These log files or information from these log files can then be used to improve document ranking, improve web crawling, determine tiers in a multi-tiered index, determine where to insert a document in a multi-tiered index, determine link weights, and update a search engine index.

Abstract: A computerized method and system for binary persistence in a system providing offerings to subscribers of a service provider are provided. The method includes receiving a plurality of objects respective of offerings made to a subscriber of a service provider; serializing the plurality of objects beginning at an origin to generate a binary record; and storing the binary record in a binary field of an entry in a database, the entry being respective of the subscriber, wherein retrieval of the offerings made to the subscriber requires merely extraction of the binary record from the binary field and performing at least a partial deserialization thereon.