Abstract: A system and method for an ultimate locking mechanism which minimizes a lock period for modifying shared data in a shared database. A process is executed as one or more initial instances and a final instance. Each initial instance reads the shared data from the shared database without acquiring a lock on the shared database. The locking mechanism obtains results that are directed to modifying the shared data and buffers the results at least partially. During or after each of the initial instances, it determines whether the next instance is to be the final one (e.g., the estimated runtime of the next instance is acceptable as the lock period). In response to a positive determination, the final instance of the process is executed. The final instance uses at least one of the buffered results during execution and acquires the lock on the shared database to modify the shared data.

Abstract: A method and apparatus are provided for ranking documents according to relevancy scoring. In one implementation, a computer-implemented method is provided for receiving search results identifying a plurality of documents resulting from a search, the plurality of documents containing one or more words. The method generates a first matrix containing a term column and a document column, wherein at least one row of the first matrix correlates one of the plurality of documents with one of the terms. The method selects a sort preference, and sorts the two-column matrix according to the sort preference. The method further generates a second matrix containing values representing a measure of overlap between the plurality of documents and the terms. The method further calculates cumulative confidence scores according to the values of the second matrix and ranks the search results according to the cumulative confidence scores.

Abstract: The subject disclosure relates to querying of column based data encoded structures enabling efficient query processing over large scale data storage, and more specifically with respect to complex queries implicating filter and/or sort operations for data over a defined window. In this regard, in various embodiments, a method is provided that avoids scenarios involving expensive sorting of a high percentage of, or all, rows, either by not sorting any rows at all, or by sorting only a very small number of rows consistent with or smaller than a number of rows associated with the size of the requested window over the data. In one embodiment, this is achieved by splitting an external query request into two different internal sub-requests, a first one that computes statistics about distribution of rows for any specified WHERE clauses and ORDER BY columns, and a second one that selects only the rows that match the window based on the statistics.

Abstract: Ontology system providing enhanced search capability receives a search request specifying nodes and edges of interest and determines a set of matching ontologies stored in a knowledge store. The ontology system also generates a ranking for each of the matching ontologies based on the extent of matching. Data indicating the matching ontologies and corresponding rank is sent as a search result.

Abstract: Based on a content attribute serving as a coordinate axis of which the setting input is performed from an operation input unit, and the content identifier of a content of interest, a metadata storage unit is searched to select one or multiple other contents relating to the content of interest. The strength of relationship between each of the selected other contents and the content of interest is calculated based on the content attribute set as a coordinate axis, and information indicating correlation. The layout relations of other contents with the content of interest as the origin are calculated based on the content attribute serving as a coordinate axis, and the calculated strength of relationship. The display image of each of the other contents is disposed in accordance with the calculated layout relations.

Abstract: A method and system for creating vertical search engines with cloud computing networks. The cloud computing networks include a cloud communications network using public networks, private networks, community networks and hybrid networks. The cloud communications network provides on-demand vertical search services, broadband network access, resource pooling, rapid elasticity and measured electronic services for vertical search engines. The method and system dramatically improve a vertical search engine infrastructure used by searchers by providing vertical electronic information using less bandwidth and less processing cycles via the cloud communications network than via a non-cloud communications network. Custom vertical search engines can be created by a user with QR bar codes and other types of bar codes and other types of custom information.

Abstract: An imaging apparatus is capable of recording a first image file and a second image file which differs from the first image file in a recording format and which needs to be managed by a management file. The imaging apparatus includes an imaging unit that converts a subject optical image into an image signal, a signal processor that creates based on the image signal the first image file, or image data including the second image file and a management file associated with the second image file, and a controller that controls the signal processor. The controller checks consistency between the management file and the second image file, and controls the signal processor such that, when the management file is not consistent with the second image file, creation of the image data is inhibited but creation of the first image file is allowed.

Abstract: A method, system, and computer-readable storage medium are disclosed for recovering a backup catalog from replicated data. A set of catalog metadata may be stored in a metadata object on a first storage device. The set of catalog metadata may describe a plurality of files stored in an archive. The metadata object and the archive may be copied to a second storage device, thereby generating a replicated metadata object and a replicated archive on the second storage device. The set of catalog metadata may be imported from the replicated metadata object into a destination backup catalog. The destination backup catalog describes the plurality of files stored in the replicated archive.

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 or 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: A query pattern handler may be configured to determine at least one query pattern to be matched against a stream of events, and may be configured to determine a plurality of run-time patterns representing active instances of the at least one query pattern which are currently available for matching, and which each include a plurality of states. An event scheduler may be configured to receive an event of the stream of events, the event associated with a current event set of the stream of events. A run-time pattern scheduler may be configured to determine a ranked set of the run-time patterns based on a priority metric which characterizes, for each run-time pattern, an advancement of each run-time pattern from a current state thereof when matched against the current event set. A pattern match evaluator may be configured to evaluate each run-time pattern of the ranked set, in turn, against the current event set.

Abstract: The systems and methods described create a mathematical representation of each of the media objects for which user ratings are known. The mathematical representations take into account the subjective rating value assigned by a user to the respective media object and the user that assigned the rating value. The media object with the mathematical representation closest to that of the seed media object is then selected as the most similar media object to the seed media object. In an embodiment, the mathematical representation is a vector representation in which each user is a different dimension and each user's rating value is the magnitude of the vector in that dimension. Similarity between two songs is determined by identifying the closest vectors to that of the seed song. Closeness may be determined by subtracting or by calculating the dot product of each of the vectors with that of the seed media object.

Abstract: A first query that is substantially similar to a second query is detected. A network of sensors includes a first sensor, a second sensor, and a data-source sensor, the first and second queries are addressed to the data-source sensor, and the first query is forwarded by the first sensor to the data-source sensor and the second query is forwarded by the second sensor to the data-source sensor. The data-source sensor provides, to the first sensor, results answering the first query. The first sensor provides the results to the second sensor.

Abstract: Systems and methods for storing and accessing data. A query language statement may reference a plurality of data sets and a plurality of algebraic relations between the data sets may be composed from the query language statement. The algebraic relations may be used to define new data sets and to optimize access to data sets. A store of algebraic relations may be accumulated over time. Alternative collections of algebraic relations may be generated and evaluated to determine an optimized collection of algebraic relations to use in calculating and providing a requested data set. The optimization may be performed using the algebraic relations rather than retrieving underlying data sets from storage. As a result, optimization may be performed at processor speeds to minimize the amount of time required for data to be retrieved from slower storage.

Abstract: Methods, systems, and apparatus, including computer program products feature selecting a file in a distributed file system. The file is associated with a time to live derived from a path name for the file. The file is divided into a plurality of chunks that are distributed among a plurality of servers. Each chunk has a respective modification time indicating when the chunk was last modified. A latest respective modification time among the respective modification times of each of the plurality of chunks is selected. A determination is made as to whether an elapsed time based on the latest modification time is equal to or exceeds the time to live. Each of the chunks of the file is deleted responsive to the determination. Other embodiments of this aspect include corresponding systems, apparatus, and computer program products.

Abstract: An apparatus and method for merging the data of a first container and a second container into a target container that includes at least one block having a plurality of extents to store data objects. The apparatus may include a storage sever coupled to a plurality of storage devices. The storage server is configured to merge multiple data objects of the plurality of containers that store a data object per each container into a target container that stores multiple data objects within the target container.

Abstract: A system and associated method for searching a web service registry system by use of a search module. A first embodiment of the search module has a search controller, a name parser, a dictionary, and a name composer. The first embodiment of the search module automatically searches a service registry program product with a service name through a first application programming interface (API). If a service description matching the service name does not exist within the service registry program product, then the first embodiment of the search module generates a candidate service name within the search module. A second embodiment of the search module consists of the search controller, the name parser, and the name composer. The second embodiment utilizes a separate dictionary program product through a second API in generating the candidate service name for a second search of the service registry program product.

Abstract: Embodiments of the present invention provide a method and system for dynamically creating a view in a distributed processing system. The system can have nodes such as a service node and a directory with entries. An object class of a view can be defined as including an attribute type that accommodates a new attribute value. An attribute value associated with one of the nodes can be received at the service node whereupon it can be determined whether the attribute value is associated with the new attribute value. A new view can be created if the attribute value is associated with the new attribute value.

Abstract: A cached version of a file system directory is synchronized with a server version of the directory in a distributed file system. Both a server and a client specify version numbers for their directory versions. On receiving a request from the client specifying a directory update, the server updates its version, increments its version number, and transmits a reply to the client containing a change log with the incremented version number. Upon receiving the reply, the client compares the received version number with that of its cached version. If the version number matches that of the next expected update, the client applies the updates to its cached version and increments its version number. Otherwise, it adds the received change log to a change log queue for the directory without incrementing the last applied version. Mechanisms are provided for handling parallel read and update requests without awaiting replies from the server.

Abstract: Methods, apparatus, and articles of manufacture for accessing process control data involve loading a client object and communicating a data access request from the client object to a real object configured to communicate with a server. The real object then communicates a query to the server based on the data access request and obtains process control data from the server in response to the query. The process control data is then mapped from a first data layout associated with a server schema to a second data layout associated with a client schema. The mapped process control data is then communicated to an application.

Abstract: A navigation system is used in combination with a data retrieval system to more effectively locate the correct answers or information in search content. The navigation system provides taxonomies that identify different information categories and sub-categories (facets). Classifiers automatically classify the search content by identifying the content corresponding with associated facets. The facets, in conjunction with the associated classifiers, provide robust classification and correlation between both structured and unstructured content. Rules can be used in conjunction with the facets and classifiers to automatically control different navigation operations. The navigation system can also leverage ontologies to dynamically create taxonomies and provides unique facet expansion and intra-document classification operations.