Abstract: Methods and Apparatus, including computer program products, for maintaining indexes in a database management system. The database management system includes a table having table entries and an index data structure having index data structure entries, the index data structure relating to the table. The index data structure is updated synchronously with an insertion of table entries. The index data structure is maintained unchanged when the table entries are deleted. It is verified by an index-scan on the index data structure that a valid criterion is fulfilled for index data structure entries, and those index data structure entries that pass the valid criterion from the index-scan are returned.

Abstract: Hierarchical temporal event management enables reduction or elimination of synchronization of multiple potentially huge indexes for real-time log indexing. Logs are time series data of events having associated times. Raw events are indexed in a hierarchical index. Transformed, filtered, or aggregated events are indexed in the hierarchical index at a different level of the hierarchy than the raw events. The result is a single hierarchical index that supports queries that optionally cross “level boundaries”, enabling a search on both aggregated information and specific elements. Such searches are usable when generating “drill down” data for graphs and reports. Search requests having corresponding search specifications are received from requestors. In response, a hierarchical event store is searched and results are provided to the requestors.

Abstract: A matching apparatus sets windows within match data, the windows each having a width larger than that in a window width condition defined in a query, and further sets windows each satisfying an event condition of a window defined in the query as temporary windows. Further, the matching apparatus checks sets of temporary windows against an interval condition and outputs events included in one or more sets of temporary windows each satisfying the interval condition, as a matching result.

Abstract: The present subject matter relates to analysis of time-series data based on world events derived from unstructured content. According to one embodiment, a method comprises obtaining event information corresponding to at least one world event from unstructured content obtained from a plurality of data sources. The event information includes at least time of occurrence of the world event, time of termination of the world event, and at least one entity associated with the world event. Further, the method comprises retrieving time-series data pertaining to the entity associated with the world event from a time-series data repository. Based on the event information and the time-series data, the world event is aligned and correlated with at least one time-series event to identify at least one pattern indicative of cause-effect relationship amongst the world event and the time-series event.

Abstract: A method and system for tracking visitors' access to web content using a searchable and size-constrained local log repository is disclosed. A repository indexer receives visitor logs from a remote source and indexes the logs to include a usage field indicating when or how frequently an associated visitor log was accessed from a local log repository by a report request manager. The local log repository stores the logs and is size constrained. A repository manager removes a subset of the logs in the local log repository based on parameters within the subset of the logs' usage field. The report request manager receives a request from a requestor for a report indicating visitors' access to a content object, searches for logs within the local log repository pertinent to the request, aggregates data across the logs responsive to the search, and generates a report presenting the aggregated data.

Abstract: Techniques for indexing file paths of items in a content repository may include taking turns in querying each different item type or folder type in a round robin schedule to visit select nodes of the folder tree of that type to update and maintain the file path indexes. Item types or folder types may be associated with a count of instances or children of instances that are missing indexes. For each item type or folder type, a query may be performed for instances of the item type or folder type having children that are missing indexes, the instances or children of the instances returned may be associated with file path indexes, and the count of instances or children of instances may be adjusted based on the associating.

Abstract: Techniques are provided for capturing events and activities that occur during a conference, generating metadata related to the events, and correlating the metadata with specific points in time, within the conference, at which the corresponding events occurred. The resulting temporally-correlated event metadata may be stored as part of the conference recording, or separate from the conference recording. Once the temporally-correlated event metadata has been stored for a conference, the conference may be indexed based on the metadata. The index may then be used to not only to locate a conference that satisfies specified search criteria, but to identify the points or snippets, within the conference, that correspond to the search criteria.

Abstract: Techniques are described for processing a query to produce query results, the query specifying at least a first timestamp value. Embodiments receive the query for processing and access a database index containing a plurality of database keys. The database index contains one or more database index keys, each of which includes at least a timestamp value and a time zone value. Embodiments compare the first timestamp value specified in the query with a portion of one the database index keys to locate at least a portion of the query results. More specifically, the compared portion of the database index key excludes the time zone value. The located portion of the query results is then retrieved.

Abstract: An audio fingerprint is generated by transforming an audio sample of a recording to a time-frequency domain and storing each time-frequency pair in a matrix array, detecting a plurality of local maxima for a predetermined number of time slices, selecting a predetermined number of largest-magnitude maxima from the plurality of local maxima detected by said detecting, and generating one or more hash values corresponding to the predetermined number of largest-magnitude maxima.

Abstract: Methods and systems are disclosed for backup using a metadata virtual hard drive (VHD) and a differential VHD. A particular system includes a memory device that stores files and a backup agent configured to detect changes to the files. The system includes a translation module configured to translate the detected changes into VHD formatted changes and a VHD module configured to write the VHD formatted changes to a metadata VHD stored at the memory device. The VHD module is also configured to generate a differential VHD based on the metadata VHD. A network interface at the system is configured to transmit the metadata VHD and the differential VHD to a remote storage device.

Abstract: Embodiments are provided for date and time handling. In some embodiments, a timestamp and a location of creation for a content item is received, a time zone offset is retrieved for the location, the timestamp is converted into a local date and time using the time zone offset, and the local date and time and the time zone offset are used to create a value for a temporal identifier, and the temporal identifier is stored for the content item.

Abstract: A data-processing technique for increasing data-size capacity and improving query speed on large datasets where fields within records are replaced by integers representing distinct values of those fields, the integers drawn from a densely-populated range so that record selection, aggregation and other actions can be performed efficiently using bit sets and other data structures.

Abstract: Read messages are grouped by a plurality of unique sequence identifications (IDs), where each of the sequence IDs corresponds to a specific read sequence, consisting of all read and read-ahead requests related to a specific storage segment that is being read sequentially by a thread of execution in a client application. The storage system uses the sequence id value in order to identify and filter read-ahead messages that are obsolete when received by the storage system, as the client application has already moved to read a different storage segment. Basically, a message is discarded when its sequence id value is less recent than the most recent value already seen by the storage system. The sequence IDs are used by the storage system to determine corresponding read-ahead data to be loaded into a read-ahead cache.

Abstract: Methods, apparatus, and computer-accessible storage media for restoring data from a snapshot to a data volume. The blocks in the volume may be treated as an implicit tree structure, for example a binary tree; each local block corresponds to a block on the snapshot. A local block on the volume may be marked, for example fingerprinted with metadata, to indicate that the local block has not been restored. Initially, the local block at the root node is marked. To restore a local block, the restore process may generate a list indicating all local blocks on a path from the root node of the tree to the target node that have not been restored. The marks in the local blocks are used in generating the list. For each block indicated in the list, children of the block are fingerprinted, and the block is restored from the snapshot.

Abstract: A method and system for indexing, searching, and retrieving information from timed media files based upon relevance intervals. The method and system for indexing, searching, and retrieving this information is based upon relevance intervals so that a portion of a timed media file is returned, which is selected specifically to be relevant to the given information representations, thereby eliminating the need for a manual determination of the relevance and avoiding missing relevant portions. The timed media includes streaming audio, streaming video, timed HTML, animations such as vector-based graphics, slide shows, other timed media, and combinations thereof.

Abstract: A method is provided for estimating distances between sensor nodes. The method includes receiving a temporal sequence of measurements of a selected local environmental condition from each of the sensor nodes. The method includes determining an amount of correlation between the measurements of the selected local environmental condition that were received from two or more of the sensor nodes. The method also includes estimating distances between the two or more of the sensor nodes based on the determined amount of correlation.

Abstract: Systems and methods for deleting non-key values from an index distributed over a plurality of computing devices maintains a non-key master list that includes the non-key values that are stored on each of the plurality of computing devices and receives a list of non-key values to delete. The systems and methods further intersect the list of non-key values to delete with the non-key master list, creating a first delete list for a first one of the plurality of computing devices that includes non-key values to be deleted that are stored on the first computing device. The systems and methods further transmit the first delete list to the first computing device and update the non-key master list based on the list of non-key values to delete.

Abstract: Methods and apparatus consistent with the invention provide the ability to organize and build understandings of machine data generated by a variety of information-processing environments. Machine data is a product of information-processing systems (e.g., activity logs, configuration files, messages, database records) and represents the evidence of particular events that have taken place and been recorded in raw data format. In one embodiment, machine data is turned into a machine data web by organizing machine data into events and then linking events together.

Abstract: A method of reducing the time taken to manufacture a bitemporal relational database is disclosed. The method involves designing business database tables with relational rules stored in a relational kernel or referential rule dictionary, and designing those tables so as to be without start date and end date columns for start of valid time and end of valid time for entities, and designing the system to be without history tables recording the history of relationships between entities in the database; the system being designed as a current view with primary key and unique key constraints, and time-related issues being taken care of by the S$, T$, and E$ tables automatically generated as the data structure of the system is populated with data.

Abstract: A method, system, and apparatus are directed to providing information over a network. A search query may be received. If the search query includes at least one keyword matching a pattern associated with a specific search engine, a plurality of search results is retrieved from the specific search engine based on the keyword, and the plurality of search results is provided. A plurality of potential search or source engines may be determined based on a current time information. At least one of the potential search or source engines may be a personalized source engine. At least one plurality of results may be retrieved from at least one of the potential search or source engines. The result may be based on the search query. An aggregated result may be determined based on a time rule and/or the current time information. The aggregated result may comprise the plurality of results.

Abstract: Techniques are provided for capturing events and activities that occur during a conference, generating metadata related to the events, and correlating the metadata with specific points in time, within the conference, at which the corresponding events occurred. The resulting temporally-correlated event metadata may be stored as part of the conference recording, or separate from the conference recording. Once the temporally-correlated event metadata has been stored for a conference, the conference may be indexed based on the metadata. The index may then be used to not only to locate a conference that satisfies specified search criteria, but to identify the points or snippets, within the conference, that correspond to the search criteria.

Abstract: The invention is directed towards enabling data volume and data type based licensing of software in a distributed system of a plurality of remote and/or local nodes. The invention enables measuring and optionally restricting the use of software based on one or more provided licenses that restrict the amount and type of data that may be processed by the software. New and older licenses may be added together for a single, bulk entitlement for a given volume of data processing for one or all types of data. Different users in the same enterprise may combine license entitlements too. Also, a new license can be acquired repeatedly, without requiring the issuance of combined licenses by the issuing authority and/or the revocation of prior licenses.

Abstract: Inverted indexes for terms and for term separators are separately provided to minimize data redundancy. Search queries are parsed to identify terms and term separators, if any, and the corresponding inverted indexes are searched for responsive documents. Related apparatus, systems, techniques and articles are also described.

Abstract: A customized, specialty-oriented database and index. of a subject matter area and methods for constructing and using such a database are provided. Selection and indexing of articles is done by experts in the topic with which the database is concerned. As a result, articles are indexed in a manner that allows facile, rapid retrieval of highly relevant articles with few or no false positives with much reduced database maintenance cost through frugal limitation of number of documents in the database, number of terms in a Master Index, and number of codes assigned to each document. A thesaurus allows indexing and search in accordance with terminology familiar to different anticipated groups of users (e.g. doctors, patients, nurses, technicians, and the like). Key articles collections and rapid access to documents therein are also provided. Additional classifications may be applied to articles or documents and searched as an additional search criterion such as a potential use.

Abstract: Graphical user interfaces (GUIs) support the collaborative generation of life stories by helping the user view the development of the life stories of other users and facilitating interaction with them through these GUIs. A GUI according to a first type helps the user keep track of recent life stories and comments posted by other users of the collaborative system, and a GUI according to a second type helps the user view life stories of any user in a chronological manner.

Abstract: The present invention relates to a method for outputting a convergence index, and more particularly, to a method for outputting a convergence index by utilizing patent information. According to the method for outputting the convergence index of the present invention, the convergence index can be outputted by using time information related to a patent which is included in a patent group, a patent classification, and an industrial classification that corresponds to the patent classification. The method for outputting the convergence index of the present invention systematically outputs the convergence index by using patent data, which is an objective data, thereby outputting the convergence index which is objective and appropriate.

Abstract: In various example embodiments, systems and methods to provide sizing content recommendations are provided. Search parameters are received from a user. In response, sizing data for the user is accessed. Using the sizing data, content from a marketplace matching the sizing data and the search parameters are determined. The matching content comprises a list of one or more items available from the marketplace. The matching content is prioritized for presentation to the user.

Abstract: Provided is a method that includes a method for updating index data. The method includes receiving index data, including an index value indicative of user activity on a network site and an index time corresponding to a time used for calculating the index value, receiving an update index time corresponding to a time used for updating the index data, determining an updated index value using an exponential decay of the index value from the index time to the update index time, wherein the updated index value comprises a decayed value of the index value corresponding to the update time, and storing updated index data including the updated index value and the update index time.

Abstract: A method and system for indexing, searching, and retrieving information from timed media files based upon relevance intervals. The method and system for indexing, searching, and retrieving this information is based upon relevance intervals so that a portion of a timed media file is returned, which is selected specifically to be relevant to the given information representations, thereby eliminating the need for a manual determination of the relevance and avoiding missing relevant portions. The timed media includes streaming audio, streaming video, timed HTML, animations such as vector-based graphics, slide shows, other timed media, and combinations thereof.

Abstract: A management module registers a request to convert code from a first code set to a second code set, identifies a code set converter (CSC), determines whether a most recently used CSC is the identified CSC and, in response to determining that the most recently used CSC is not the identified CSC, locates a user-preferred CSC pool comprising a subset of locally stored CSCs each corresponding to a preference index. The management module, in response to determining that the identified CSC is located within the user-preferred CSC pool, searches the user-preferred CSC pool for the identified CSC, loads the identified CSC, initiates the identified CSC that converts the code from the first code set to the second code set, modifies usage data for the identified CSC, and orders the user-preferred CSC pool based on a preference index for each CSC stored in the CSC pool.

Abstract: A method can include receiving a search request from a user interface (UI), selecting one or more repositories in response to the search request, and displaying, on a display device, search results corresponding to the selected repositories. The selected repositories are a subset of a plurality of available repositories, as specified by an administrator. By selecting or de-selecting the available repositories, a user can define or refine a search of the available repositories. In various implementations, the method includes interface elements that assist a user in previewing revised search results based on revised selections of repositories, and/or selections of subcategories of information available in one or more of the repositories.

Abstract: A data searching system is provided for real-time database searching. The data searching system includes a plurality of databases having respective maximum data capacity, and a searching module configured to provide a searching service interface. The data searching system also includes an index module configured to write received data into one of the plurality of databases, to treat the received data as the most up-to-date data to be stored over data having a longer existence le period in the plurality of database when the plurality of databases are filled; and to create indices of the plurality of databases.

Abstract: An electronic device, data processing method, data control method, and content data processing system enabling a user to search for a track reproduced in the past, but with a forgotten title name and an artist name. A CPU displays on an LCD panel a reproduction history screen displaying a number of tracks reproduced that day on a calendar. By a user operation via an input device, the CPU switches the reproduction history screen to another reproduction history screen displaying a list of tracks reproduced on a certain other day as the reproduction history list. It reproduces the track selected by the user and allows editing of its attribute.

Abstract: An MMR system for processing image queries across index tables with unequal priority comprises a plurality of mobile devices, a pre-processing server or MMR gateway, and an MMR matching unit, and may include an MMR publisher. The MMR matching unit receives an image query from the pre-processing server or MMR gateway and sends it to one or more of the recognition units to identify a result including a document, the page, and the location on the page. The MMR matching unit includes a dispatcher, a plurality of recognition units, and index tables, as well as an image registration unit. In one embodiment, the system includes an MMR matching plug-in installed on the mobile device. The present invention also includes methods for processing image queries across index tables of unequal priority and updating a high priority index based on received or projected image queries.

Abstract: Embodiments of the present invention include a method and apparatus for performing incremental mapping of virtual machine incremental images. The method and apparatus comprise creating a map of the base file as well as the incremental file, utilizing at least a portion of the file tables contained in the various images. This map indicates the type of change (i.e., whether the file is contained completely in an incremental image, is contained in the base image, or is contained in both). In another embodiment, the map may also contain the location of the change or the location of the file within the sequentially stored images upon the backup media.

Abstract: Methods, devices and computer program products facilitate enhanced use and interaction with a multimedia content through the use of tags. While a content is being presented by a device, a content identifier and at least one time code associated with one or more content segments are obtained. One or both of the content identifier and the time code can be obtained from watermarks that are embedded in the content, or through computation of fingerprints that are subsequently matched against a database of stored fingerprints and metadata. The content identifier and the at least one time code are transmitted to a tag server. In response, tag information for the one or more content segments is received and one or more tags are presented to a user. The tags are persistently associated with temporal locations of the content segments.

Abstract: A SEQUENCED request a) to apply a temporal Source table to a temporal Target table under a predicate is received. The Source table includes a plurality of rows that qualify to apply to a single Target table row under the predicate. The predicate specifies a Source table join column. Each of the plurality of Source table rows and the single Target table row include a ValidTime dimension. The plurality of Source table rows is b) ordered by the Source table join column and a period-to-be-modified. The next of the ordered plurality of Source table rows is c) applied by determining that the Target table row has a TransactionTime and, in response, closing out the TransactionTime of the Target table row. Applying the next of the ordered plurality of Source table rows includes identifying an RDIFF range as the period-to-be-modified of the Source table row being applied that is later than the ValidTime range of the single Target table row.

Abstract: A search device includes a first search section and a second search section. The first search section searches, for second image data sharing a common attribute with first image data being processed by an image processing apparatus, a storage section in which image data processed by the image processing apparatus is stored. The second search section searches the storage section for third image data processed by the image processing apparatus within a time period from a predetermined time before a reference time to a predetermined time after the reference time, the reference time being a point of time at which the second image data was processed by the image processing apparatus. This makes it possible to prevent a search omission in the search device for searching for the second image data sharing a common attribute with the first image data.

Abstract: The present invention relates to processing of time series data. There is disclosed a method and apparatus for processing time series data, the method comprising: receiving a time series data set, wherein each element of the time series data set contains a timestamp and an original value associated with the timestamp, and times represented by all timestamps constitute a time series having fixed time intervals; converting each original value into a coded value occupying a smaller storage space, according to a predetermined monotone numerical compression coding scheme; dividing the times represented by all timestamps into a plurality of time intervals having a predetermined length; assembling coded values corresponding to all timestamps within each time interval into a data package such that the data package contains coded values arranged in an order of timestamps; and storing in a database record each data package and its associated identification of a time interval.

Abstract: In one embodiment, a computer implemented method is illustrated as including receiving selection data generated by a media player application, the selection data being related to digital content. Additionally, generating an instruction set that includes the selection data, the instruction set being formatted based upon a Uniform Resource Identifier (URI) schema. Inserting the instruction set into a query portion of a URI. A method is also illustrated as including receiving a URI associated with digital content, the URI containing an instruction set in a query portion of the URI. Parsing the instruction set to retrieve selection data relating to the digital content. Further, the method may include retrieving the digital content based upon the selection data. Moreover, the method may include generating a data stream including the digital content. Additionally, the method may include transmitting the data stream including the digital content.

Abstract: A indexing engine and method are provided for operating an indexing engine that parses and indexes data created by a set of users associated with a business entity on a database while interacting with a service associated to the database, the method comprising: monitoring the users' interactions with the database related to a creation of new data by one or more of the users over a predefined period of time when using the service; monitoring service availability during these interactions over the same predefined period of time; and changing an indexing frequency based on both parameters associated with the monitoring of the users' interactions and the service usage conditions.

Abstract: The present disclosure relates to searching electric power system waveforms. Disclosed herein are various systems and methods for improving search performance through indexing electric power system waveforms using waveform attributes such as frequency, amplitude, angle, rate of change, and the like. According to some embodiments, multiple indexes may be used together to find information of interest. A reference signal may be utilized according to some embodiments. Normalizing a plurality of waveforms using a reference signal may facilitate the use of an index for comparing two arbitrary waveforms. This disclosure also relates to detecting and indexing islanding conditions in an electric power system. Various embodiments may utilize information relating to islanding conditions in connection with search operations.

Abstract: A system and method for keeping track of events. In the preferred embodiment, a counter is created on a mobile device and is set to update one or more values based on the occurrence of a triggering event. The triggering event may be based on the user pressing a button or otherwise interacting with the mobile device, or may be based on other functions of the mobile device, such as the arrival in a particular location as determined by GPS. Counters may be shared with other mobile devices, and data in the counters may be stored on the mobile device or in a remote location. Mobile devices can share data from their counters with other mobile devices, and counters can be set to compare data between different mobile devices. Alerts can be set based on predetermined criteria.

Abstract: A method and system for tracking use of audio and audiovisual works is described. Known are converted into a time series of frequency domain signatures. As the system detects unknown works transmitted or otherwise available for analysis, the unknown works are converted into a time series of frequency domain signatures and then the sequence of signatures matched in the database of known works. When a known work is found to have signatures that meet a matching test with an unknown work, a database is updated to reflect that the unknown work is an instance of the known work. The system includes a remote detector that receives unknown content and generates signatures that are transmitted to another location for where the matching is performed.

Abstract: Systems and methods for generating a common social timeline to facilitate social discovery in a social networking environment are disclosed. In one aspect, embodiments of the present disclosure include a method, which may be implemented on a system, of receiving user data items associated with users of the web-based social network, associating a time indicator with each of the data items, processing the data items to identify a first set of data items that are common to a first user and a second user, and generating a common social timeline that illustrates a temporal relationship between each of the first set of data items and one or more time scale identifiers.

Abstract: A software and/or hardware facility is described that enables searches for transient multimedia resources that are contained in real-time multimedia streams. Because real-time data streams are not archived for subsequent access, transient resources contained in the streams are preferably quickly identified, characterized in a database, and indexed so that the facility can locate transient resources that are responsive to search queries. Stream listeners are disclosed that are configured to monitor data streams and identify transient resources within the streams based on associated metadata. Various techniques are disclosed to optimize the operation of the stream listeners. In response to a search query, search results are generated by the facility that include transient multimedia resources that are accessible via a network at the time that the search query is received.

Abstract: Each of a plurality of Worker processes are allowed to perform any and all of the following tasks involving logged work items: (1) reading a subset of the work items from a log; (2) sequentially ordering work items for corresponding data objects; (3) applying a sequentially ordered set of work items to a corresponding data object; and (4) transmitting a subset of work items to a Worker process running on another database server in a cluster, if necessary. These tasks can be performed concurrently, at will, and as available, by the Worker processes. An improved checkpointing technique eliminates the need for the Worker processes to get to a synchronization point and stop. Instead, a Coordinator process examines the current state of progress of the Worker processes and computes a past point in the sequence of work items at which all work items before that point have been completely processed, and records this point as the checkpoint.

Abstract: In one implementation, a conference bridge or a multipoint conference unit (MCU) receives media streams from the endpoints in the conference. The media stream may contain at least one of audio, video, file sharing, or collaboration data. The MCU measures a characteristic in each of a plurality of media streams and calculates statistics based on the individual participation levels of the endpoints. A dynamic participation indicator displayed at the endpoints shows the relative participation levels of the endpoints. For example, the dynamic participation indicator may show the names of the users in a font that changes size and/or location as the participation level changes. In another example, the dynamic participation indicator may show respective videos of the endpoints in a format and/or size that changes as the participation level changes.

Abstract: A data indexing system is provided. The system includes: a time interval splitting unit configured to split a predetermined time range into a plurality of time intervals. A first index creating unit is configured to create a first-level index for data in a current time interval, the first-level index including a time interval index and a subspace index. A second index creating unit is configured to create, in a time interval after the current time interval, a second-level index for data in the current time interval. The second-level index has a finer granularity than the first-level index. A data indexing method and a data querying method are also provided. The cost for index maintenance can be greatly reduced in a case of frequent updates. Further, invalid scans during the query process can be reduced and the query performance can be improved.

Abstract: A Searchable Symmetric Encryption (SSE) mechanism is described which allows efficient dynamic updating of encrypted index information. The encrypted index information includes pointer information that is encrypted using a malleable encryption scheme. The SSE mechanism updates the encrypted index information by modifying at least one instance of the pointer information without decrypting the pointer information, and thereby without revealing the nature of the changes being made. In one implementation, the SSE mechanism includes a main indexing structure and a deletion indexing structure. An updating operation involves patching applied to both the main indexing structure and deletion indexing structure.