Abstract: Architecture for restoring nodes. After restoring a node, fix-up occurs to make the node appears as a different node than before the restore operation. The node appears as a new node, which new node knows the data up to a certain point from when the new node had the prior identity. This allows for new changes generated by the new node to flow to the other nodes in the topology, as well as have the changes that the prior identity sent to other nodes flow back to the new node. In other words, the architecture maintains information to create the new node in the topology while maintaining prior data knowledge. Additionally, item level metadata of associated data items is updated to correlate with the updated data items so that changes can be correctly enumerated and applied. This metadata update occurs across scopes of which the data items are included.

Abstract: A plurality of queries of an in-memory column-oriented database are obtained. Each of the queries has at least one column predicate. For each of the queries, it is determined which of a plurality of columns in the in-memory column-oriented database need to be scanned. The plurality of queries are grouped into a plurality of scan groups, based at least in part on the determining step. The column predicates are evaluated for those of the queries in a given one of the scan groups in accordance with a scheduling scheme. The grouping step and the scheduling scheme take into account real time scan information.

Abstract: A flexible and extensible architecture allows for secure searching across an enterprise. Such an architecture can provide a simple Internet-like search experience to users searching secure content inside (and outside) the enterprise. The architecture allows for the crawling and searching of a variety of sources across an enterprise, regardless of whether any of these sources conform to a conventional user role model. The architecture further allows for security attributes to be submitted at query time, for example, in order to provide real-time secure access to enterprise resources. The user query also can be transformed to provide for dynamic querying that provides for a more current result list than can be obtained for static queries.

Abstract: Provided are a method for attaching a geographical tag to digital data and a method for providing geographical name information for geotagging. When a digital device periodically provides its position information, the server creates a position database. When the digital device requests geographical name information associated with the digital data, the server estimates the position of the digital device at a time when the digital data was created and transmits geographical name information corresponding to the estimated position to the digital device. The digital device attaches the geographical name information to the digital data.

Abstract: Copy protected materials are backed up or restored and made available for play on electronic media players through an online retrievable system. Corrupted segments of electronic media storage files are identified and located prior to being read, executed, or played. An uncorrupted copy from the network is then located, and software instructions provide for the storage of the uncorrupted segment of the file on electronic media player, merging the uncorrupted segment into the reading, executing, or playing of the electronic storage media file to seamlessly produce an output in real-time that is indistinguishable from the uncorrupted file.

Abstract: A system and method of storing information about tree structures. The method includes, for each given tree, identifying the nodes and the relationships between the nodes, and for each parameter, if more than one node of any of the given tree shares the parameter, then defining a scoping for the parameter to cover all of the nodes to which the parameter is applicable. The scoping includes applying one or more scope types having a varying specificity. The resulting information stored about the tree structure is substantially reduced in size in comparison to information about tree structures stored in a conventional manner, thereby reducing storage space requirements.

Abstract: Provided are an extended multimedia file structure, a multimedia file producing method, and a multimedia file executing method. The extended multimedia file structure includes: a metadata section including a media initial object descriptor (IOD) field and at least one track pointer; and a media data section including at least one media block indicated by the track pointer, wherein the at least one track pointer indicates a detail media resource contained in an embedded multimedia file or an external multimedia file.

Abstract: Methods to enable optimization of discontinuous rank metrics are described. The search scores associated with a number of search objects are written as score distributions and these are converted into rank distributions for each object in an iterative process. Each object is selected in turn and the score distribution of the selected object is compared to the score distributions of each other object in turn to generate a probability that the selected object is ranked in a particular position. For example, with three documents the rank distribution may give a 20% probability that a document is ranked first, a 60% probability that the document is ranked second and a 20% probability that the document is ranked third. In some embodiments, the rank distributions may then be used in the optimization of discontinuous rank metrics.

Abstract: A new continuous query to a data stream management system (DSMS) may use a stream or a relation which may or may not be used by continuous queries previously registered in the DSMS. The DSMS is programmed to modify an execution plan to accommodate execution of the new query while continuing to execute the previously registered continuous queries. The modified execution plan may include new operators and/or share existing operators. The DSMS is programmed to cause operators which output a relation to propagate a current state of the relation to each newly-coupled operator that uses the relation. The current state is propagated only to operators that have been newly coupled and have thus not yet received any state information previously. After propagation of current state to newly-coupled operators, results of processing any new data for the relation are supplied to all operators coupled thereto, including newly-coupled operators and existing operators.

Abstract: Techniques for remote redirection are discussed. Redirection may be used to mimic a local user experience on a remote system. Redirection may include redirecting a pointer file, such as a shortcut, to account for remote access to a source file designated in the pointer file. The pointer file may be remapped so that the pointer file's file path accounts for a path from the remote access to the source file. Operating system (OS) information may be forwarded to the accessing system so that the redirected pointer file may be presented in accordance with the remote system's (OS). Redirection may be used to present a directory remotely in accordance with operating system running on the system being accessed.

Abstract: A new continuous query to a data stream management system (DSMS) may use a silent relation whose source does not provide any heartbeats. During execution of any given operator, the DSMS processes data from one input (“active input”) using its time stamp as if the same time stamp is received from another input whose relation has fallen silent (“empty input”), if one or more predetermined conditions are met. One predetermined condition is that the empty input's operator has all its own inputs silent. And another predetermined condition is that a maximum time stamp that is currently present among all the inputs of the empty input's operator is equal to a time stamp that was last received from these same inputs. When both conditions are met, previously received data from the empty input is time stamped with the same time stamp as the most recently received data from the active input.

Abstract: Computer-readable media, systems, and methods for enabling a rich client search experience. In embodiments, a description is received from a data store. The description includes fields of information existing on the data store that are capable of being searched. A user interface is built based on the description and the user interface provides a user with a mechanism for searching the data store. And the user interface is presented to the user. The description is definable by the data store using a data-driven extension, allowing the data store to express schema and query capability information to a client and allowing the client to dynamically customize the user interface based upon the schema and query capability information expressed by the data store.

Abstract: Systems and methods for automatically delivering information to a user concerning the embedded code contained in a web page before the user downloads the web page are disclosed. A search engine, in addition to performing a standard subject matter word search requested by a user, searches each web page to be listed to the user as part of the search results for information indicating that there is embedded code in the web page. If it is determined that a web page contains embedded code, the search results graphical user interface is provided with additional information indicating to the user which web page in the results contains embedded code. The user may also be alerted if a web page contains embedded code known to be malicious and the order of the search results may be modified based on the embedded code information of the web pages in the results.

Abstract: A method of sourcing a piece of equipment or a replacement part includes preparing a part request record, providing a part source database, searching part source records in the database according to one or more search parameters associated with the part, part requestor or part source, creating a prospective part source list, and prioritizing the part source list by one or more indexing fields, to identify sources predicted to have the part at the best combination of quality, price, and other similar factors. A method of updating the indexing fields is also disclosed.

Abstract: A method and system for improving targeted data delivery. One method accesses a user profile based on information about a user from at least one electronic device from a set of electronic devices that is associated with the user. A targeted data offer is received, wherein the targeted data offer defines selection criteria for targeted user profiles. A determination is made as to whether the user profile satisfies the selection criteria. A non-user selected relevancy criteria based on the user profile is then utilized to characterize the targeted data offer.

Abstract: A keyword advertising service method for providing search information in response to a search request, the method includes the steps of: maintaining a search information database for storing at least one search information record; receiving a search request packet including a keyword inputted in a partner site selected by a user and a site identifier for identifying the partner site, from the partner site; extracting, in response to the search request packet, at least one search information record including a keyword corresponding to the keyword included in the search request packet, from the search information database, by using the bidding participation fee; rolling the extracted search information records independently from the bidding participation fee to be displayed on a result list field and providing the result list field to the partner site in response to the search request; and charging an advertiser corresponding to the search information record, in the case the user clicks the search information r

Abstract: Markup language node level hash join operations for evaluating a query language query are performed. The markup language node level hash join mechanism, i.e. the “XHashJoin” operator, is a multi-way join operator that uses two hash tables, BUILD and PROBE, to intersect document nodes from multiple index scans and to buffer intermediate query results. The BUILD hash table stores document nodes matching the predicates of a query, and buffers document nodes satisfying extraction nodes, of each portion of the query up to a current portion of the query being evaluated. The BUILD hash table and the PROBE hash table are switched at each portion of the query being evaluated. Query results are generated by linking document nodes buffered in the BUILD hash table based on the semantics of each extraction node.

Abstract: Systems and methods for processing an index are described. To insure that the most updated index is available without having to update the index after every change (which can consume enormous resources), a specially marked postings list is generated for a changed item. During retrieval, the specially marked postings list supplements the existing content of an inverted index referencing the changed item. In this manner, the retrieval result for items containing the term under which the changed item was originally indexed is updated in accordance with the specially marked postings list to insure the most accurate retrieval result.

Abstract: A method for achieving interactive browsing includes steps performed by a computer coupled to a knowledge base and a document database. The knowledge base stores a plurality of terms and information relating to each term, and the document database stores a plurality of documents. The steps include acquiring terms in which a user has interest; extracting information relating to the terms in which the user has interest from the knowledge base in order to display the information in a first display part of a user interface; and extracting documents containing the terms in which the user has interest from the document database in order to display a list of extracted documents in a second display part of the user interface.

Abstract: The invention relates to a method for performing operations of an oilfield having at least one wellsite, a surface network, and a process facility, each wellsite having a wellbore penetrating a subterranean formation for extracting fluid from an underground reservoir therein.