Abstract: A file server performs duplicate elimination on files, and creates a virtual file system that does not include a duplicate file and is used for creating a search index. A search server acquires search target files from the virtual file system in the file server, and creates the search index.

Abstract: A method for decoding encoded structured data from a bit-stream comprising a plurality of encoded data units having the steps of, obtaining unit information comprising positions of the encoded data units within the bit-stream, retrieving the encoded data units from the bit-stream based on the unit information, creating decoding tasks for decoding the retrieved encoded data units, assigning the created decoding tasks to cores of a multi-core decoder, based on estimated decoding costs of the encoded data units, running the tasks on their assigned cores to decode the encoded data units in parallel is disclosed. It is applied to the decoding of XML documents in the EXI format.

Abstract: Techniques are provided to achieve performance improvements for path-based access to hierarchical data and for utilizing an extensible indexing framework. Extensible operators may be optimized by evaluating the operators using functions native to the database system instead of using functions defined through an extensible indexing mechanism. Furthermore, the database system may resolve a resource path of a query when the query is compiled, and may store the mapping of the resource path to one or more resources in a cursor for the query execution plan to avoid resolving the resource path each time the cursor is used to run the query. The cursor may be made dependent on the one or more resources to which the resource path refers at compile time. This takes advantage of the observation that the mapping of the resource path to particular resources rarely changes between evaluations of a particular query.

Abstract: Example apparatus, methods, and computers support data de-duplication indexing. One example apparatus includes a processor, a memory, and an interface to connect the processor, memory, and a set of logics. The set of logics includes an establishment logic to instantiate one-to-many de-duplication data structures, a manipulation logic to update the de-dupe data structure(s), a key logic to generate a key from a block of data to be de-duplicated, and a similarity logic to make a similarity determination for the block. The similarity determination identifies the block as a unique block, a duplicate block, or a block that meets a similarity threshold with respect to a stored de-duplicated block accessible through the dedupe data structure. The similarity determination involves comparing the block to be de-duplicated to a stored block available to the apparatus using a byte-by-byte approach, a hash approach, a delta hash approach and/or a sampling sequence approach.

Abstract: Provided are techniques for creating an inverted index for features of a set of data elements, wherein each of the data elements is represented by a vector of features, wherein the inverted index, when queried with a feature, outputs one or more data elements containing the feature. The features of the set of data elements are ranked. For each feature in the ranked list, the inverted index is queried for data elements having the feature and not having any previously selected feature and a cluster of the data elements is created based on results returned in response to the query.

Abstract: An apparatus comprising a storage device comprising a hash table including a plurality of buckets, each bucket being capable of storing at least one data item, and a processor configured to apply at least a first and a second hash function upon receiving a key to generate a first index and a second index, respectively, the first and second indices identifying first and second potential buckets in the hash table for storing a new data item associated with the key, determine whether at least one of the first and second potential buckets have space available to store the new data item, and responsive to determining that at least one of the first and second potential buckets have available space, insert the new data item into one of the first or second potential buckets determined to have available space.

Abstract: Techniques for enhanced updating of a partitioned index include first data that indicates a plurality of fields for each entry in an index for a data store. A current number of partitions for the index is determined. Second data that indicates at least one value for at least one field of at least a first entry in the index is received. A next number of partitions for the index based on the second data is determined automatically.

Abstract: A processor-implemented method, system and/or computer program product for managing computer file storage is presented. A file, which is designated for storage, is received. Upon determining that the file exceeds a pre-determined size, the file is stored in a pre-designated folder that is reserved for oversized files. This pre-designated folder is protected such that any file stored within the pre-designated folder is prevented from being moved into archival storage.

Abstract: Embodiments of a method are disclosed that comprise receiving, over a communications network, user-initiated quantitative sentiment ratings regarding an entity and calculating a real-time sentiment index for the entity using the received sentiment ratings. Embodiments of apparatus are also disclosed that comprise a plurality of computing devices each including an interface configured for the input of user-initiated quantitative sentiment ratings and a server which is configured to (i) receive sentiment ratings from the plurality of computing devices, (ii) determine a first subset of the received sentiment ratings that relate to a first entity, and (iii) calculate a first real-time sentiment index for the first entity using sentiment ratings from the first subset.

Abstract: A highly flexible and extensible structure is provided for physically storing tabular data. The structure, referred to as a compression unit, may be used to store tabular data that logically resides in any type of table-like structure. According to one embodiment, compression units are recursive. Thus, a compression unit may have a “parent” compression unit to which it belongs, and may have one or more “child” compression units that belong to it. In one embodiment, compression units include metadata that indicates how the tabular data is stored within them. The metadata for a compression unit may indicate, for example, whether the data is stored in row-major or column major-format the order of the columns within the compression unit (which may differ from the logical order of the columns dictated by the definition of their logical container), a compression technique for the compression unit, the child compression units (if any), etc.

Abstract: A method and apparatus for maintaining source ready information are disclosed. A first copy of the source ready information is stored in an Architectural Register Name (ARN)-indexed structure and a second copy of the source ready information is stored in a Physical Register Number (PRN)-indexed structure. As new instructions become available that require at least one source, the ARN-indexed structure is accessed. If at least one new source becomes available, the ARN-indexed structure and the PRN-indexed structure are updated to include information regarding the new sources.

Abstract: Each time sequential data is generated by a data generation source (001), the data is inputted into a sequential data memory unit (002) and accumulated in a memory device. Each time sequential data is inputted, a sequence summary unit (003) creates a sequence approximation function that approximates the inputted sequential data and previously inputted sequential data. A summary result memory unit (008) stores the sequence approximation functions that were created by the sequence summary unit (003). At specified timing, an accumulated data summary unit (005) creates, from a specified range of sequential data that was accumulated in the sequential data memory unit (002), a collective approximation function that approximates that sequential data with that range as the domain.

Abstract: Various embodiments for rewriting data in a deduplication storage environment by a processor device are provided. A dynamic layer above a sequential deduplication file system (denoted as DFS) implements the rewrite functionality. A user file is composed of one or more DFS files. As incoming data is written into a user file, the data is written by the dynamic layer sequentially into DFS files, created one by one. For each user file this dynamic layer creates and maintains a dynamic metadata file, in a regular, non deduplicated file system. This metadata file contains entries pointing to sections of DFS files.

Abstract: Systems and methods provide for indexing audio content by fusing the indexes derived from a keyword stream and a large vocabulary stream search. For example, systems and methods provide for two stream searching of Spoken Web VoiceSites, wherein metadata is extracted from the VoiceSite and is used to determine a set of keywords for high precision search while a traditional standard vocabulary set is used to perform a high results, low precision search. The results of the keyword search and the standard vocabulary search are fused together to form a comprehensive, ranked list of results.

Abstract: A system and method of generating a contact list based on a geographic definition and, in certain embodiments, other screening criteria. In an embodiment, a geographic definition, specifying a geographic area, is received. The geographic definition is translated into at least one linkage key. A contact list, comprising a plurality of records associated with the geographic area, is then generated from one or more databases using the at least one linkage key as an index into the one or more databases.

Abstract: A method of generating a skip list is disclosed. The skip list comprises a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, a total number of the plurality of linked lists being constrained by an available memory of a memory system, the method comprising the steps of: inserting a first node of the plurality of nodes into a predetermined linked list of the plurality of linked lists of the data structure of the skip list in the available memory; promoting the first node to one or more other linked lists based on a first set of criteria; and generating the skip list by inserting at least a second node of the plurality of nodes into the data structure and promoting the second node based on a second set of criteria, said second set of criteria being different from the first set of criteria.

Abstract: In one embodiment the present invention includes a computer implemented method of processing information stored in a data structure. The method includes continuously generating individual records and storing the individual records in a database as a plurality of records. The method further includes selecting, according to a time period, a set of the plurality of records that qualify according to the time period. The method further includes moving the set to a table in the database, wherein the table excludes the plurality of records that are not in the set. In this manner, the records may be stored in a number of parallel tables, and this process may be managed at the application level instead of at the database level. Using parallel tables instead of a single large table may offer performance improvements, for example regarding deleting (or archiving) data.

Abstract: Techniques for organizing single or multi-column temporal data into R-tree spatial indexes are provided. Temporal data for single or multiple column data, within a database system, is converted into one or more line segments. The resulting line segments are transformed into a minimum bounding rectangle (MBR). Finally, the MBR is inserted into an R-tree spatial index.

Abstract: A method of improving the speed with which a sample data record can be matched against records in a database comprises defining a list of possible key values (430), testing those key values against the sample and, for each record in the database, counting the number of key values that match both the record and the sample at reference positions selected by a mask. A list of possible matches is then selected on the basis of that count, for more detailed matching or analysis. Such a method provides very fast matching at the expense of some additional effort when registering a new record within the database.

Abstract: A scale-Space feature extraction technique is based on recursive decomposition of polyhedral surfaces into surface patches. The experimental results show that this technique can be used to perform matching based on local model structure. Scale-space techniques can be parameterized to generate decompositions that correspond to manufacturing, assembly or surface features relevant to mechanical design. One application of these techniques is to support matching and content-based retrieval of solid models. Scale-space technique can extract features that are invariant with respect to the global structure of the model as well as small perturbations that 3D laser scanning may introduce. A new distance function defined on triangles instead of points is introduced. This technique offers a new way to control the feature decomposition process, which results in extraction of features that are more meaningful from an engineering viewpoint. The technique is computationally practical for use in indexing large models.

Abstract: A method, device, and non-transitory computer-readable storage medium are provided for efficiently registering a relational schema. In co-compilation and data guide approaches, a subset of entities from schema descriptions are selected for physical registration, and other entities from the schema descriptions are not physically registered. In the co-compilation approach, a first schema description references a second schema description, and the subset includes a set of entities from the second schema description that are used by the first schema description. In the data guide approach, the subset includes entities that are used by a set of structured documents. In a pay-as-you-go approach, schema registration includes logically registering entities without creating relational database structures corresponding to the entities. A database server may execute database commands that reference the logically registered entities.

Abstract: A system for information retrieval within a database of large size includes a first module for extracting the descriptors associated with each object in the database, and for constructing a table containing the objects and the value of a descriptor associated with an object. The system also includes a second module for applying a number of classification algorithms, for each of the tables obtained from the module, a third module to fusion the results obtained from the module in order to determine, for each type of descriptor, a class number associated with an object, a fourth module for finding which column of a table is closest to the column obtained during the first fusion of the step, and for selecting the map that is closest contained in the table, or best map, and a fifth module to fusion the aggregate “best maps”, and applying an algorithm for searching for the best map to be transmitted to a display means.

Abstract: Disclosed herein is a data compression method for improving a compression rate when compressing computer data by employing both a method of generating a character string dictionary and storing indexes and a method of storing compression codes corresponding to character strings. Accordingly, a compression rate and a decompression speed increase.

Abstract: A system having a plurality of local image storage elements storing patient images, each patient image being indexed by a local patient identifier, an identity storage element, located remotely from the local storage elements, storing a global patient identifier corresponding to each of a plurality of patients and one or more of the local patient identifiers corresponding to each of the plurality of patients and a location storage element, located remotely from the local image storage elements, storing an index of the patient images, the index including the local image storage element location of each image and the corresponding global patient identifier.

Abstract: A Fragrance Sampling, and Exhibition System includes at least one fragrance card, fragrance, and a laminated envelope. The fragrance is disposed upon the fragrance card. The fragrance card is disposed within the laminated envelope.

Abstract: Methods and computer storage media are provided for generating entries for documents in a forward index. A document and its document identification are received, in addition to static features that are query-independent. The document is parsed into tokens to form a token stream corresponding to the document. Relevant data used to calculate rankings of document is identified and a position of the data is determined. The entry is then generated from the document identification, the token stream of the document, the static features, and the positional information of the relevant data. The entry is stored in the forward index.

Abstract: A system and method for identifying unique and duplicate messages is provided. Messages are maintained, and a header and message body are extracted from each of the messages. A hash code is calculated for each message over at least part of the header and the body of that message. The messages with matching hash codes are grouped. One message in each group with two or more messages is randomly selected as a unique message. The remaining messages in the group are marked as exact duplicate messages.

Abstract: A method of recording user activity of a user on a comprising the steps of providing a file to a user from a network; transmitting and storing the file to a file archive; gathering user activity data for each file accessed; associating user activity data with each file accessed; and transmitting and storing user activity data; categorizing user activity data; ranking user activity data; compressing/decompressing user activity data; removing redundant data from file archive; collecting file enhancement data, associating the file enhancement data with a file being currently accessed by the user, and transmitting the file enhancement data; storing the actual content accessed by the user and the file enhancement data as stored material; indexing the stored material; receiving a command, including input parameters, for conducting a search of the stored material, the input parameters including keyword and file enhancement data from the user; generating a customizable user activity report.

Abstract: A method and system for replacing data in a design template. An end-user may provide a dynamic, structured client data set to be adapted to a predetermined, structured design template (e.g., a map or report). A repository of design templates may be searched to discover a list of candidate templates that may be capable of matching the client data. The end-user may select a design template that may be capable of showing the client data. The server may match the client data to a data structure for a candidate design template by using a data replacement approach, such as a column/alias approach. The end-user may potentially enlarge the matching set by providing information to help the matching algorithm; for example, providing column aliases where the matching algorithm may match template data column and column alias names with those specified for the client dataset.

Abstract: A method, an article of manufacture, and system for heapifying an object. The method includes: storing, in a working set, a first address of a certain object in a stack frame, copying the certain object into the heap area and holding a second address of the certain object in the heap area, following each stack frame to find a pointer pointing to the first address stored in the working set, converting the address that the pointer points to into the second address, proceeding to a next stack frame, where the address conversion includes storing an address of another object in the working set if the converted address is stored as a value of a field of the other object in the stack frame, and terminating the process in response to a lack of pointers found in the stack frame to point to the addresses stored in the working set.

Abstract: Methods and apparatus, including computer program products, for compression of tables based on occurrence of values. In general, a number representing an amount of occurrences of a frequently occurring value in a group of adjacent rows of a column is generated, a vector representing whether the frequently occurring value exists in a row of the column is generated, and the number and the vector are stored to enable searches of the data represented by the number and the vector. The vector may omit a portion representing the group of adjacent rows. The values may be dictionary-based compression values representing business data such as business objects. The compression may be performed in-memory, in parallel, to improve memory utilization, network bandwidth consumption, and processing performance.

Abstract: A System, method and application for creating comprehensive multiple mixed media knowledge storage and management, discovery and retrieval utilizing novel indexing and querying applied to content from multiple media formats from disparate sources is disclosed. Depending on the media format the system breaks down the source information in any media into constituent units (“tokens”) using a reference corpus of labeled tokens (“training set”). The details of tokens are stored in an inverted index with available reference data such as location in the file, time, source file and additional information related to the token such as quantitative similarity to the best-match token(s) in the training set etc. During retrieval, a query comprising of single element in any media; a multimedia element or a combination of such elements including a sequence of such elements in a time line is similarly broken down into constituent units to generate a novel query structure.

Abstract: A computer-implemented method for deduplicating an incoming data sequence can include the steps of storing signature values for a plurality of data blocklets of a parent data sequence in a deduplication index, sequentially storing signature values for at least some of the plurality of data blocklets of the parent data sequence in a first storage location outside of the deduplication index, determining that a first data blocklet in the incoming data sequence is absent from the parent data sequence, storing a signature value for the first data blocklet in a second storage location outside of the deduplication index, storing a guarded link linking the first data blocklet to the second data blocklet into the second storage location, determining that a second data blocklet that follows the first data blocklet in the incoming data sequence is present in the parent data sequence, the second data blocklet having a signature value that is stored in the first storage location, and copying at least a portion of the cont

Abstract: Systems and methods are disclosed for performing garbage collection to identify content segments no longer referenced in a deduplicating storage system in which redundant mark operations in a mark-and-sweep technique are avoided. An organized arrangement of hash structures is created for each data object, wherein each structure includes a hash signature for a corresponding content segment and is associated with a reference to the corresponding content segment, and the logical organization of the arrangement represents the logical organization of the content segments as they are represented within the data object. Additionally, for each data object, temporal states are maintained over time. Garbage collection iterates over the temporal structures and, for each temporal structure, marks the garbage collection state for the associated content segments for only the content segments that have changed relative to an immediately prior temporal state of the data object.

Abstract: Concepts and technologies are described herein for contextual and task-focused computing. In accordance with the concepts and technologies disclosed herein, a discovery engine analyzes application data describing applications, recognizes tasks associated with the applications, and stores task data identifying and describing the tasks in a data storage location. The task data is searchable by search engines, indexing and search services, and task engines configured to provide tasks to one or more client devices operating alone or in a synchronized manner, the tasks being provided on demand or based upon activity associated with the one or more client devices. A task engine receives or obtains contextual data describing context associate with the client devices and/or social networking data associated with one or more users of the client devices.

Abstract: A log consolidation device includes: a selection unit that selects at least part of fields included in multiple logs stored in a storage unit and chronologically representing processes executed by one or multiple processing units, each log including information representing content of a process and a count value relating to the process, the information being divided into multiple fields; a deletion unit that deletes, from at least part of the multiple logs stored in the storage unit, items of information in the fields selected by the selection unit; and an integration unit that integrates into a single log two or more of the multiple logs having identical items of information in fields that were not deleted by the deletion unit by summing up the count values of the two or more of the multiple logs.

Abstract: An approach is provided for creating a range ordered tree structure. A tree index platform determines one or more ranges for grouping one or more data objects of a key-value store. Next, the tree index platform determines to specify the one or more ranges in one or more respective index objects of a data structure. Then, the tree index platform determines to associate the data structure with the key-value store.

Abstract: Disclosed are a system and method for managing digital contents. An exemplary embodiment according to the present invention provides to a system for managing digital contents, including a learning module extracting feature vectors of input digital contents and performing column subspace mapping on the feature vectors to calculate a column subspace projection matrix; an index module using the matrix to perform an index work on the digital contents and then, storing the matrix and the digital contents; and a search module performing the column subspace mapping on the feature vectors of query data when the query data for searching the digital contents are input and searching the digital contents indexed by the matrix having high similarity to the mapped feature vectors of the query data.

Abstract: A server architecture performs concurrent information processing in a server system on a multi-core processor environment. The architecture supports simultaneous processing requests comprising multiple classes of queries and/or executing transactions in an application server and/or database server. Requests, which are made in an asynchronous manner, are structured with hash values to enable similar requests to be grouped together. The similar requests are grouped into a group session. All of the requests in the group session are executed at the same time. Accordingly, similar database inserts can be grouped and executed as a single request. The architecture minimizes thread-switching overhead by exploiting inherent parallelism in the inflowing requests. The threads and requests are de-coupled and hence any lock request only makes the execution threads take up another request instead of waiting until the lock is acquired.

Abstract: A method in one example implementation includes extracting a plurality of data elements from a record of a data file, tokenizing the data elements into tokens, and storing the tokens in a first tuple of a registration list. The method further includes selecting one of the tokens as a token key for the first tuple, where the token is selected because it occurs less frequently in the registration list than each of the other tokens in the first tuple. In specific embodiments, at least one data element is an expression element having a character pattern matching a predefined expression pattern that represents at least two words and a separator between the words. In other embodiments, at least one data element is a word defined by a character pattern of one or more consecutive essential characters. Other specific embodiments include determining an end of the record by recognizing a predefined delimiter.

Abstract: Hyperspace index data structure. A data structure indexes identifiers corresponding to parameter patterns. The presence of an identifier in the data structure indicates that the corresponding parameter pattern may be present in a set of parameter patterns, while absence of the indicator can be used to indicate that the corresponding parameter pattern is not present. The data structure includes a first field which includes binary bits or groups of small parameter pattern keyed records. Each binary bit or parameter pattern keyed record corresponds to an identifier corresponding to a parameter pattern. If the bit or record corresponding to the identifier is set or present, the identifier is included in the first field. One or more additional fields are hierarchically below the first data field. Each of the additional fields includes identifiers for a subset of information in the first field.

Abstract: A system and method for data analysis and digital forensics is provided. The system for data analysis and digital forensics may include: an online data forensic server for collecting and analyzing usage history information from an object device, which is subject to data collection, downloading and collecting data on the Internet based on the usage history information, requesting issuance of a timestamp token for the collected data, and receiving the issued timestamp token; a timestamp token issuing server for issuing the timestamp token for the collected data in response to the request for issuance of the timestamp token and proving the issued timestamp token to the online data forensic server; and a storage device for storing the collected data.

Abstract: A system and method are provided for organizing a listing of activities on a social networking website, including present each user of the plurality of users an organized representation of activities, the representation of activities sorted by how relevant each activity is to the particular user.

Abstract: The subject disclosure relates to column based data encoding where raw data to be compressed is organized by columns, and then, as first and second layers of reduction of the data size, dictionary encoding and/or value encoding are applied to the data as organized by columns, to create integer sequences that correspond to the columns. Next, a hybrid greedy run length encoding and bit packing compression algorithm further compacts the data according to an analysis of bit savings. Synergy of the hybrid data reduction techniques in concert with the column-based organization, coupled with gains in scanning and querying efficiency owing to the representation of the compact data, results in substantially improved data compression at a fraction of the cost of conventional systems.

Abstract: A re-configurable logic device such as a field programmable gate array (FPGA) can be used to deploy a data processing pipeline, the pipeline comprising a plurality of pipelined data processing engines, the plurality of pipelined data processing engines including a data reduction engine, the plurality of pipelined data processing engines being configured to perform processing operations, wherein the pipeline comprises a multi-functional pipeline, and wherein the re-configurable logic device is further configured to controllably activate or deactivate each of the pipelined data processing engines in the pipeline in response to control instructions and thereby define a function for the pipeline, each pipeline function being the combined functionality of each activated pipelined data processing engine in the pipeline.

Abstract: Methods of compressing XML source data include identifying each element type of the XML source data, generating a representation of element names for each identified element type, and generating a representation of data content for each instance of each element type separate from the representation of element names of the element types.

Abstract: A system and method for analyzing visual memes includes identifying visual memes associated with at least one topic in a data source. The visual memes propagated over time are tracked to extract information associated with identified visual memes. The information associated with the visual memes is analyzed to determine at least one of generation, propagation, and use of the identified memes.

Abstract: A computer-implemented method, apparatus, and computer-readable media for mapping product records according to attributes in a standard schema, the standard schema mapping product records from a plurality of content providers according to a product hierarchy from each respective content provider, the method including: receiving product data from a plurality of feeds including feeds from one or more content providers; identifying a plurality of product records received from each of the plurality of feeds; identifying a taxonomy of products received in each of the plurality of feeds; and storing product records and corresponding product attributes in a standard schema in a data set for each feed according to the taxonomy identified for each respective feed.

Abstract: Methods, data processing systems and machine readable non-transitory storage media are described that can provide, in one embodiment, a non-time based description of types of metadata in a time based metadata track that can be associated with, in time, a time based media track. The description can include a set of keys, or other identifiers, that specify the types of metadata in the metadata track, and the description can also include values describing the structure of each key and values describing how to interpret each key.

Abstract: A method of managing device data related to a data center infrastructure includes generating, by a first server, a first portion of the device data in response to a change in a status of at least one of a plurality of data center infrastructure devices, storing, by a second server, the first portion of the device data in a database, generating, by the first server, a second portion of the device data in response to a request for data that is not contained in the database, the second portion of the device data being different than the first portion of the device data and being generated in a lightweight format, and displaying, in response to a user request, at least a portion of the device data using a user interface that is provided to the client computer by the second server.