Abstract: A system for document retrieval in a network environment is provided where documents are stored with corresponding privacy codes. A query server computer is in communication with the network and is programmed to generate a privacy index of all documents available on the network indexed by their corresponding privacy codes. The privacy codes define document access permissions that are securely associated with the documents and are assigned by document custodians. A search engine in communication with the network is configured to receive a query from a requester and generate a list of documents from the privacy index which match search parameters of the query and privacy codes of the requester.

Abstract: A system comprising a processor, a data storage device that is accessible by the processor, and filesystem software that is executable by the processor to organize files on the data storage device are provided. The filesystem software is executable to maintain a filename cache comprising filename entries. The filename entries may include a filename header section and each filename entry identifies a filename of a corresponding file.

Abstract: A method of searching in a database of feed items enables efficient searching through a large corpus of data. Each feed item is associated with at least one object in the database. An index of feed items is generated. For each feed item in the database, the index includes a body of the feed item and at least one foreign key that identifies an object associated with the feed item. A search request with one or more search terms is received from a first user. Using the index of feed items, a pre-filtered set of feed items is generated for the first user. The search is executed, using the index of feed items and the pre-filtered set of feed items. Search results are limited to feed items in the pre-filtered set of feed items.

Abstract: A computer-implemented process for write barrier elision during program execution receives a request to overwrite a reference, determines whether garbage collection is active and responsive to a determination that garbage collection is active, determines whether a reference object has been scanned. Responsive to a determination that the reference object has not been scanned set a mark bit for the reference object in a modified mark map, the reference object is scanned and a scan bit is set for the reference object in the modified mark map.

Abstract: The method of the present invention provides a labor and time saving ability to determine interrelationships within patents determined by searching, via a computer system, through patent fields to see if one or more particular pieces of alphanumeric data are common to any of the patents in the database in which the field indicia are located. Such commonality is searchable in backward or forward direction, or both, from, for example, one patent of particular interest. The method allows for presentation of families of interrelated patents within minutes rather than hours, weeks or longer by utilizing computer based technology. Further, the methodology allows for determinations of interrelationships within desired degrees of separation by manipulation of the indicative data to be searched.

Abstract: An index is created for a database by selecting at least one column of a database table as a basis to create the index, generating at least one index of a tree structure according to the at least one column, where a pointer stored in a leaf node of the at least one index is null. In an example embodiment, a value to a pointer is stored in a leaf node according to an intermediate result in response to the intermediate result being generated, where the pointer stored in the leaf node points to a data page storing the intermediate result. The created index can be reused and the intermediate result can be effectively used, such that the efficiency of database operation is improved.

Abstract: A method of annotating video programs (media) with metadata, and making the metadata available for download on a P2P network. Program annotators will analyze a video media and construct annotator index descriptors or signatures descriptive of the video media as a whole, annotator scenes of interest, and annotator items of interest. This will serve as an index to annotator metadata associated with specific scenes and items of interest. Viewers of these video medias on processor equipped, network capable, video devices will select scenes and items of interest as well, and the video devices will construct user indexes also descriptive of the video media, scenes and areas of interest. This user index will be sent over the P2P network to annotation nodes, and will be used as a search tool to find the appropriate index linked metadata. This will be sent back to the user video device over the P2P network.

Abstract: Data records in one or more databases may be scanned to create a search index. The search index may include an identifier for each data record scanned, and a list of fragments of data in one or more data fields of each scanned data record. Each fragment in the list may be created by extracting a fixed number of adjoining characters from data in each data field of a corresponding data record. The list of fragments may include all fixed number of adjoining character sequences in each data field of a data record. Multiple search indexes may be included, with each search index including a different fixed number of adjoining characters in the fragment list. Systems and methods may be provided.

Abstract: The present invention relates to the identification, extraction, linking, storage and provisioning of data that constitute the captioned components of published or “print ready” literature for computerized information discovery activities including search, browse and data mining. These components, or objects, include the tabular presentation of data (“tables”) and graphics such as “figures”, “images” and “illustrations” typically used to supplement the textual narrative of the publication.

Abstract: A parsing and indexing mechanism for dynamically generated reports is provided. Upon detection of a dynamically generated report, a data source for the dynamically generated report may be identified based on metadata or other information associated with the report. Crawleable or machine readable metadata and data may be generated using the data source such that data represented in the report and/or other relevant data from the data source can be indexed and searched.

Abstract: There is provided a method for accessing at least one audio file from a collection comprising more than one audio file stored within or accessible with an electronic device. The method includes generating one index comprising of information entries obtained from each of the more than one audio file in the collection, with each audio file in the collection information being linked to at least one information entry; receiving an input during an input reception mode; converting the input into a digital signal using an analog-digital converter; analysing the digital signal using either frequency spectrum analysis or melody contour analysis into discrete portions; and comparing the discrete portions with the entries in the index. It is advantageous that the audio file is accessed when the discrete portions substantially coincide with at least one of the information entries in the index. The discrete portions may be musical notes, melody contours or waveforms.

Abstract: Systems and methods are provided for handling uncorrectable errors in a non-volatile memory (“NVM”), such as flash memory, during a garbage collection operation.

Abstract: In one embodiment, a method includes accessing data; partitioning the data into sub-blocks; determining whether a first one of the sub-blocks is identical to another one of the sub-blocks or similar to another one of the sub-blocks; if the first one of the sub-blocks is identical to another one of the sub-blocks, applying by the one or more computer systems hash-based deduplication to storage of the first one of the sub-blocks with respect to the other one of the sub-blocks; and, if the first one of the sub-blocks is similar to another one of the sub-blocks, applying by the one or more computer systems sub-block differencing to storage of the first one of the sub-blocks with respect to the other one of the sub-blocks.

Abstract: A suite of network-based services, such as the services corresponding to Microsoft® SharePoint™, are provided to users with high availability. The suite of network-based services may include browser-based collaboration functions, process management functions, index and search functions, document-management functions, and/or other functions. In particular, the indexing service associated with the suite of network-based services may be provided with high availability.

Abstract: An apparatus, method and article of manufacture of the present invention detects the presence of references to the same concept in separate sections of text, and, with no input required from the reader, presents the reader with information concerning the detected references to the concept. The information provided may comprise information related to the location of the reference to the concept in other sections of text, and the reader also is provided the ability to move from one reference to a concept directly to another reference to the same concept.

Abstract: A technique for managing storage of a data object in a storage device involves receiving the data object (A) to store in the storage device, where the data object has an indicator bit pattern (P). Successive compression data transformations are applied to data object A to obtain respective corresponding compressed data objects, and one of these compressed data objects is selected, such that the selected compressed data object (C) has the shortest length with respect to the remaining compressed data objects. Compression information (I) is then associated with the compression data transformation used to generate data object C, and a threshold value T is calculated at least partly from the length of compression information I. If length (C)+T.gtoreq.length (A), then the indicator bit pattern of data object A is reset and the data object A is written to the storage device.

Abstract: This disclosure relates to systems and methods for both maintaining referential integrity within a data storage system, and freeing unused storage in the system, without the need to maintain reference counts to the blocks of storage used to represent and store the data.

Abstract: A system is described for optimizing lead close rates. The system may create a seller scoring model that may be “trained” by a sales lead data over a period of time. The scoring model may be used to measure the performance of sellers in terms of handling and closing sales leads. The scoring model may be used to predict the sellers' close rates for future leads. The system may normalize the sellers based on lead volume to increase the confidence level in the scoring model. The system may utilize the scoring model to determine lead specific handling instructions for future leads to optimize sellers' close rates.

Abstract: A file storage and retrieval method or technique for processing alpha numeric information that has particular advantages when accessing data in a database on a computer. The retrieval technique uses the ASCII values of characters in a search string concatenated together to form a numeric value which serves as the index to the data itself or to the index which holds the computer address of the location of the data. This technique allows data to be accessed with only one access when searching for a word or phrase within a database and lends itself for use on static storage systems of the future as well as on current disk based systems.

Abstract: The data processing method reversibly processing data information input to a data processing device by a processing unit including a data volume reducing unit reducing a data volume of the data information, and a developing unit reconstructing data information reduced in the data volume reducing unit. The processing unit is structured by overlaying processing layers formed of a plurality of cells. The data volume reducing unit performs unit processing on each of the plurality of cells having the data information. The unit processing performs identification processing by a weight according to equivalence and distance of data from a cell group adjacent to the cells, and reduces the cells by each of the processing layers in an order from a lower layer to an upper layer of the processing layers until a data position existing on a time axis of the cells stops to thereby reduces the data volume.

Abstract: In one embodiment, input is received from a user defining a classification and an analytic for the classification. Multiple classifications and analytics may be defined by a user. A definition of relevance parameters is determined that characterize the classification and a set of analytics measures associated with the analytic. The definition may be for the classification. Unstructured data and structured data are analyzed based on the definition of the relevance parameters to determine relevant data in the unstructured data and the structured data. The relevant data being data that is determined to be relevant to the classification defined by the user. An index of the terms from the relevant data is determined. The index is useable by an analytics tool to provide results for queries of the unstructured data and structured data. The query may be used within the classification such that targeted results are provided using the index and the relevant data to the classification.

Abstract: Disclosed herein are systems, methods, and non-transitory computer-readable storage media for providing just-in-time resources based on context. A system configured to practice the method identifies a communication event associated with a user and a current context associated with the communication event and the user, and identifies a stored context that corresponds to the current context, wherein the stored context includes at least one resource. The system then retrieves the at least one resource and presents the at least one resource to the user. In another method for storing a current context, the system identifies a current communication context, identifies resources associated with the current communication context, indexes the current communication content and resources to enable searchability, and stores, as a stored context in a database, the current communication context and the resources associated with the current communication context.

Abstract: A method and apparatus for ranked join indices includes a solution providing performance guarantees for top-k join queries over two relations, when preprocessing to construct a ranked join index for a specific join condition is permitted. The concepts of ranking join indices presented herein are also applicable in the case of a single relation. In this case, the concepts herein provide a solution to the top-k selection problem with monotone linear functions, having guaranteed worst case search performance for the case of two ranked attributes and arbitrary preference vectors.

Abstract: Capturing complex artistic intent for an image having image data for multiple pixels. Plural look algorithms are defined, where each look algorithm applies color adjustments to one or more colors to produce corresponding output colors. An artistic intent is identified for each pixel of the image, where the artistic intent is constituted by chained application of one or more of the look algorithms. Information identifying the artistic intent for each pixel of the image is stored in a format that stores the artistic intent identification information together with the image data for each pixel of the image.

Abstract: Methods and apparatus teach a digital spectrum of a file representing underlying original data. The digital spectrum is used to map a file's position. This position relative to another file's position reveals closest neighbors. When multiple such neighbors are grouped together they can be used to indicate relevance in current data under consideration on a same or different computing device. Also, relevance can be found without traditional notions of needing structured data or users initiating searching for relevance or by examining metadata/administrative information associated with the files. A dynamic relevancy agent is configured for installation on the same or different computing device to monitor events regarding the current data and to initiate the examination of relevancy. It also presents to a user suggestions of data closest to the current data. Various triggering events to undertake a relevancy examination are also described as are predetermined criteria to define relative closeness.

Abstract: A computer-implemented method for garbage collection in deduplicated data systems may include: 1) identifying a deduplicated data system, 2) identifying at least one segment object added to the deduplicated data system during a garbage-collection process of the deduplicated data system, 3) locking the segment object to prevent removal of the segment object by the garbage-collection process, and 4) unlocking the segment object after the garbage-collection process. The method may allow a small possibility of incorrectly removing useful segment objects. The method may also verify data objects during the garbage-collection process and recover incorrectly removed segment objects. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Methods and systems for partitioning search indexes are described. In one embodiment, such a method includes identifying, via a partition manager, a search index to be partitioned, where the search index includes a plurality of entity types, and wherein each of the plurality of entity types associates records stored in a data store with the respective entity type within the search index. The method further includes partitioning, via the partition manager, the search index into a first partitioned search index and a second partitioned search index, correlating, via a partitioning scheme, a first subset of the plurality of entity types with the first partitioned search index, and correlating, via the partitioning scheme, a second subset of the plurality of entity types with the second partitioned search index.

Abstract: Techniques are provided for (2) extending SQL to support direct invocation of frequent itemset operations, (3) improving the performance of frequent itemset operations by clustering itemset combinations to more efficiently use previously produced results, and (4) making on-the-fly selection of the occurrence counting technique to use during each phase of a multiple phase frequent itemset operation. When directly invoked in an SQL statement, a frequent itemset operation may receive input from results of operations specified in the SQL statement, and provide its results directly to other operations specified in the SQL statement. By clustering itemset combinations, resources may be used more efficiently by retaining intermediate information as long as it is useful, and then discarding it to free up volatile memory.

Abstract: Described embodiments provide coherent processing of hash operations of a network processor having a plurality of processing modules. A hash processor of the network processor receives hash operation requests from the plurality of processing modules. A hash table identifier and bucket index corresponding to the received hash operation request are determined. An active index list is maintained for active hash operations for each hash table identifier and bucket index. If the hash table identifier and bucket index of the received hash operation request are in the active index list, the received hash operation request is deferred until the hash table identifier and bucket index corresponding to the received hash operation request clear from the active index list. Otherwise, the active index list is updated with the hash table identifier and bucket index of the received hash operation request and the received hash operation request is processed.

Abstract: An improved system and method for efficiently evaluating complex Boolean expressions is provided. Leaf nodes of Boolean expression trees for objects represented by Boolean expressions of attribute-value pairs may be assigned a positional identifier that indicates the position of a node in the Boolean expression tree. The positional identifiers of each object may be indexed by attribute-value pairs of the leaf nodes of the Boolean expression trees in an inverted index. Given an input set of attribute-value pairs, a list of positional identifiers for leaf nodes of virtual Boolean expression trees may be found in the index matching the attribute-value pairs of the input set. The list of positional identifiers of leaf nodes may be sorted in order by positional identifier for each contract. An expression evaluator may then verify whether a virtual Boolean expression tree for each contract is satisfied by the list of positional identifiers.

Abstract: The present disclosure provides an apparatus and method for packet classification using a Bloom filter and includes determining a matching length of how long each field value of one or more fields in an input packet coincides with a field value of the corresponding field stored in a rule set by performing a field-by-field search on the fields in the input packet, and generating a tuple list made up of a combination of one or more of the matching length for the respective fields; selecting particular tuples existing in the rule set from the tuple list; filtering each of the selected tuples by using the Bloom filter; and searching for a best matching rule as a search pool exclusively within the tuples with the positive result of the filtering. According to the present disclosure, the object tuples to search can be substantially relieved to improve the searching performance.

Abstract: The index update unit analyses the information stored in a document repository to create an index for search and stores the index in a time-series divisional index storage unit and creates, from an ACL repository, an access control entry ACE in association with the index for search, which is correlation of information to be searched with access right of at least a group to which the user belongs. The ACL cache generation unit creates ACL cache data that correlates the user with access right to the information to be searched, from the ACE, and registers the ACL cache data created in an ACL cache. A search processing unit searches for an index for search in response to a request for search from said user. In case the ACL cache data correlating the user with the index for search is registered in the ACL cache, the search processing unit_takes, from among the information searched, the information, reference to which is allowed for the user as a search result, based on information in the ACL cache.

Abstract: A system and associated method for automatically processing keyword for video content. The video content contains image frames and an audio stream. An image pattern table for image patterns from the image frames and a word pattern table for word patterns from the audio stream are generated by use of respective pattern names provided by pattern recognition tools. Each pattern is associated with a respective count indicating a number of appearances of each pattern. A respective weight of each pattern is calculated as a relative frequency of each pattern. The image pattern table and the word pattern table are merged to generate a keyword list. A predefined number of most frequently appeared patterns are selected by examining the respective weight of each pattern and metadata associated with the video content are updated to utilize pattern names of the selected patterns as keyword for web searches.

Abstract: A method for retrieving information from a document includes a process of grouping paragraphs in the document to form passages, and forming indexes relating to a number of words in the passages. The number of paragraphs in a passage is determined based on the number of paragraphs considered optimum for a writer to cover a particular topic. Passages are formed by merging each N consecutive paragraphs in the document, where N is an integer greater than 1. Thus, individual passages may include paragraphs that are identical to other passages.

Abstract: A computer-readable medium, computer-implemented method, and system are provided. In one embodiment, a new order header object and an original order header object that share a source order number are selected, and one or more new order line objects based on the new order header object are also selected. One or more original order line objects based on the original order header object are selected and the one or more new order line objects and the one or more original order line objects are compared. Where a new order line object and an original order line object match, a reference identity of the new order line object is set to an identity of an original order line object.

Abstract: Example apparatus, methods, data structures, and computers control indexing to facilitate duplicate determinations. One example method includes indexing, in a global index, a unique chunk processed by a data de-duplicator. Indexing the unique chunk in the global index can include updating an expedited data structure associated with the global index. The example method can also include selectively indexing, in a temporal index, a relationship chunk processed by the data de-duplicator. The relationship chunk is a chunk that is related to another chunk processed by the data de-duplicator by sequence, storage location, and/or similarity hash value. Indexing the relationship chunk in the temporal index can also include updating one or more expedited data structures associated with the temporal index. The expedited data structures and indexes can then be consulted to resolve a duplicate determination being made by a data reducer.

Abstract: An operating system on a source computer system includes a filtered remote journal mechanism that generates a target map of a remote journal to specify where in the remote journal entries will be stored, then generates a vector array that represents the data of interest in the database journal based on specified selection criteria and the target map. The vector array and location information from the target map is then sent to a communication manager, which sends the data indicated in the vector array to the target computer system. On the target computer system, the communication manager reads the data sent from the source computer system and writes the data to the remote journal. The filtered remote journal mechanism may operate on an existing database journal, or may operate iteratively as journal entries are written on the source computer system.

Abstract: A method includes indexing data and/or metadata in online virtual machines (VMs), offline VMs, virtual applications, and/or snapshots thereof on one or more host server(s) in a virtualization environment through a search architecture in the virtualization environment. The online VMs are VMs that are powered on, and the offline VMs are VMs that are powered off. The method also includes maintaining a database of the indexed data and/or metadata in the online VMs, the offline VMs, the virtual applications, and/or the snapshots thereof to enable a comprehensive search result to a search query through the search architecture. The database is associated with the search architecture.

Abstract: Making data available from a database is disclosed. Making data available includes specifying a query function having a query function name, wherein the query function includes a structure and a member, determining the structure and the member included in the query function, wherein the query function has a query function name and includes the structure and the member, creating an index for the structure on the member, and compiling the query function to be available to a user by invoking the query function name without the user having to specify the structure and the member. Retrieving data from a database is disclosed. Retrieving includes invoking a query function that specifies a plurality of structures and a value, accessing a cross index of the plurality of structures, and using the cross index to access the data.

Abstract: Systems and methods are provided for message-based distributed computing systems and execution of message-based distributed applications on such systems. The present invention provides a Distributed Application Platform (DAP). The DAP architecture is “distributed” because functions of an application may be performed by processes within a single node, spread across nodes in a network, or spread across processor cores within CPUs. Some embodiments of the DAP provide efficient programming constructs, called sets. A set is a data structure describing an N-dimensional space. Each spatial location is either empty or holds a member. The set construct allows automatic extraction and processing of members with a single query, and makes programming an application for a distributed, parallel, or single computer environment easier for a user. In some embodiments, the DAP may be a message-based distributed computing system.

Abstract: Portions of a B-tree index in a database are locked for concurrency control. In one example, hierarchical lock modes are provided that permit locking a key, a gap between the key and the next key, and a combination of the key and the gap. In another example, key range locking may be applied to the B-tree index using locks on separator keys of index nodes. In another example, key range locking may be applied to the B-tree index using locks on key prefixes.

Abstract: A set of sensors can capture raw data that geospatially corresponds to a real world volumetric space. The raw data can include point cloud data encoded in a light detecting and ranging (LiDAR) information format, imagery and video data, and elevation data encoded in a digital elevation model (DEM) or digital surface model (DSM) format. The real-world volumetric space can be segmented into a set of volumetric units, wherein datum of the raw data is indexed against the volumetric units. Each of the volumetric units of the real-world volumetric space can be mapped to a voxel in a storage volumetric space of a voxel database. The raw data can then be stored and fused in the voxel database such that each voxel in the voxel database represents a combination of volumetrically stored data for all source products that includes providing point cloud data, imagery data, and elevation data.

Abstract: A probabilistic database can including a set of geospatially referenced records and a probability engine. The geospatially referenced records corresponding to a real-world volumetric space indexed against voxels. Each voxel can have a unique identifier in the probabilistic database. Each voxel can corresponds to a volumetric unit of the real-world volumetric space. Geospatial information referenced against voxels can be internally inconsistent, which results in a naturally probabilistic storage format. The probability engine can be operable to dynamically determine a certainty value for an object of the probabilistic database. The certainty value can be a value from zero to one hundred percent, which is based upon a statistical analysis of the internally inconsistent geospatial information referenced against the voxels. The internally inconsistent geospatial information can correspond to a volumetric unit of the real-world volumetric space in which the object has a probability of residing within.

Abstract: A system can include a voxel database and the set of applications. The voxel database can include a set of voxel indexed records, wherein the voxel database manages a volumetric storage space corresponding to a real-world volumetric space, where units of real-world volumetric space and data specific to these units map to voxels and attributes of voxel indexed records. Each of the applications can include a user interface that renders a volumetric simulation space that corresponds to the volumetric storage space. Geospatial data for the simulation space can include visual attributes used to render a graphical user interface representation of the simulation space, where these visual attributes are acquired from the voxel database. The applications can have different geospatial formatting and content needs from each other, yet the content needs of each of the applications can be supported by the voxel database.

Abstract: A broadcaster-specific service module is provided for applications hosted by a processing device. The broadcaster-specific service module and the applications communicate through a common service bus. The broadcaster-specific service module receives items from an online broadcaster via a network, with each item associated with a media file or stream available from the online broadcaster. The broadcaster-specific service module generates a catalog containing a tree of the items, and sends the catalog to a target application via the service bus to display the catalog for user selection. The broadcaster-specific service module formats data of the catalog can be understood by all of the applications attached to the service bus.

Abstract: A hybrid database can receive a hybrid query for an object having a real world analog. A feature of a set of feature records can be determined that corresponds to the object. Feature-level attribute values of the feature can be extracted from the feature records. A volumetric envelope forming an outer boundary of the feature in a volumetric storage space of the hybrid database can be determined. A set of uniquely indexed voxels can be determined. Each voxel can be a volumetric unit of the volumetric storage space that represent the volume contained by the volumetric envelope. Voxel-level semantic values can be extracted from the set of uniquely indexed voxels from voxel records. Extracted voxel-level semantic values and extracted feature-level attribute values can be combined to generate a hybrid result. The hybrid result can be conveyed to a requestor from which the hybrid query was received.

Abstract: A system and method for using topic messages to understand media relating to an event. An event (such as a live event or broadcast event), is selected where at least a portion of the content of the event is stored as at least one media object, such as, for example a video or audio recording in digital format. A plurality of topic messages relating to the broadcast event is retrieved over a network and are analyzed to identify a plurality of content segments within the event. The topic messages are further analyzed to identify at least one key actor related to the event. Segment and key actor data relating to the event is stored to a computer readable medium in association with the media objects, whereby the segment data identifies the plurality of content segments within the media objects and the key actor data identifies key actors in the event.

Abstract: A method and apparatus for efficient indexed storage for unstructured content have been disclosed.

Abstract: A device for dynamically extracting and compressing information for a streaming media asset is provided. One embodiment of the device provides a computing device comprising a processor and memory comprising instructions stored therein that are executable by the processor. The instructions stored in the memory are executable to provide to a requesting computing device dynamically compressed information for a streaming media asset, the dynamically compressed information derived from an information file comprising variable data elements arranged in one or more data fields according to a well-known structure. For example, the instructions are executable to receive from the requesting computing device a request for the compressed information, extract the variable data elements from the information file, compress the variable data elements to form compressed data elements, and send to the requesting computing device a compressed file comprising the compressed data elements.

Abstract: A navigation system compresses original map data to generate compressed map data. The navigation system compares a size of the original map data with a size of the compressed map data and selectively transmits the original map data or the compressed map data based on the comparison.