Abstract: A method is provided of validating details associated with a copyrighted work. The work and associated data are received at a first server from a first party and stored in an online database. The work and the data are further associated with the first party and one or more other parties. The data includes a relationship status between the parties and the work, and details associated with the work. The online database is reviewed for preexisting confirmation of the relationships. Where the relationships are unconfirmed, confirmation requests are transmitted to the one or more other parties via the communications network seeking confirmation of the relationships. Upon confirming said relationships, the other parties are contacted seeking validation or correction of the details provided by the first party. Validated details or corrected details are then received from one or more of the other parties and stored on the online database.

Abstract: A method and mechanism for performing an operation based on multidimensional data in a relational database. A first query is submitted to a relational database engine of the relational database management system, thereby causing a relational cube to be generated. The first query includes instructions to select a portion of multidimensional data for inclusion in the relational cube. The first query includes instructions to group the selected portion of multidimensional data using at least two or more levels of granularity of at least one dimension. The first query also includes instructions to generate a materialized view. Based on a received request for an operation, a second query is submitted to the relational database engine for execution against the relational cube, thereby causing the operation to be performed.

Abstract: A system, method, and computer program product are provided for analyzing a plurality of rules in a textual rules structure. Further, the plurality of rules are decomposed into a plurality of contexts, based on the analysis. In addition, the plurality of contexts are stored in a table. Furthermore, a database associated with a device and/or any robot equipped with an operating system may be utilized.

Abstract: A system, method, and computer program product are provided for storing a data stream in a first table of a database. Further, a plurality of contexts associated with the data stream are identified. Additionally, the data stream is filtered, utilizing plurality of contexts. Furthermore, the database may be associated with a device and/or any robot equipped with an operating system.

Abstract: A data processing system accesses a group of events to identify a group of types of events and aggregates at least some of the events into a group of items. Each of the events is aggregated by binding another event to an event identified as a particular type of event based on a correspondence between the event and the particular type of event and binding additional information to the event identified as the particular type of event based on a relationship between the additional information and the particular type of event. The data processing system also rendezvous one of the items with an event.

Abstract: Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph.

Abstract: A computer system affords a user the ability to interactively formulate, visualize, and modify query plans that are to be posed to a database. The computer system provides query visualization in the form of decision trees having nodes selectable/deselectable to search for alternative query plans with lower or minimum execution time. The estimated cost and/or the execution time of a subtree of a query plan may be mapped according to a rectangle area metaphore, with the area of a rectangle enclosed by a larger rectangle representing a parent node in the plan tree. Query plans may be saved by the system in order to facilitate their visualization, optimization, and/or modification at a later date.

Abstract: A listing tune-up system is provided. An example listing tune-up system may include a detecting module to detect a listing for an item. The listing may comprise various information including a title, and a category of the item for transaction. The example listing tune-up system may include a determining module to determine a recommended category set for the item using categories of existing listings that match one or more keywords in the title. The example listing tune-up system may include a verifying module to verify whether the category of the item complies with the recommended category set. The example listing tune-up system may further include a generating module to generate a tune-up report for the listing upon completion of the verification. The tune-up report may comprise the recommended category set and/or other editing suggestions.

Abstract: Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph.

Abstract: Systems and methods of tracking and rewarding users of search engines, content networks, communication networks, other networks and/or combinations of networks are described. In many embodiments, users create accounts and control when and the type of information that is tracked. The tracked information can be used to provide rewards, customize offers and rewards and to improve services provided to the user. One embodiment includes receiving secure identification information from the user, retrieving user account information using the secure identification information, receiving a search query from the user, crediting the user account with a reward that is directly related to providing the search query, and returning search results.

Abstract: Various methods and systems for performing cascaded replication are disclosed. For example, one method involves receiving an acknowledgment at a primary replication site from an intermediate replication site. The acknowledgment identifies whether a change has been applied to a remote replication site. The method also involves updating a journal, in response to the acknowledgment. The journal identifies whether the change is currently being replicated. The method can also involve detecting that the intermediate replication site is inaccessible. In response, the method synchronizes a copy of application data at the remote replication site by applying one or more changes identified in the journal to the copy of the application data at the remote replication site.

Abstract: A distributed file system and method distributes file system objects across multiple self-contained volumes, where each volume is owned by a unique file system node. Logical links are used to reference a file system object between volumes. Each file system node includes a relocation directory in which is maintained hard links to locally-stored file system objects that are referenced from another file system node using logical links. Various file system operations that involve multiple volumes are performed without having to place a write lock on more than one volume at a time. Various caching schemes allow the various file system nodes to cache file system object data and metadata.

Abstract: An indication of refusal of a lock request is received with a first operation identifier for a resource that is already locked with a lock associated with a second operation identifier from an agent that controls the resource, wherein the agent returns a value that determines how long the lock request is to stay on the queue. The lock request is placed in a queue with a lock queue timeout period based on the value from the agent. The lock request is reissued if the lock associated with the second operation identifier has been released and the lock request reaches a position of the queue from which the lock request is processed within the lock queue timeout period. The lock request is re-queued if the reissued lock request is not granted based on how many times the lock request has been previously placed in the queue.

Abstract: A method, device, and system are provided for accessing metadata in a data storage system. More specifically, a requesting application requests a cache application to allocate a cache page to retrieve metadata from a storage device. After metadata is written to the cache page, the cache page is locked by the requesting application. The cache page is maintained in a locked state by the requesting application. This allows the data stored within the cache page to be quickly accessed and updated by the requesting application without waiting for the cache page to be written back to the storage device after every update to the cache page occurs.

Abstract: Techniques and tools are described for converting XML documents and XML schema documents to OWL. An OWL model ontology can be generated by receiving XML schema documents, performing schema consolidation, and generating the OWL model ontology from the consolidated XML schema. An OWL instance ontology can be generated by receiving XML documents and XML schema documents and generating an OWL instance ontology from the XML documents and the XML schema documents. OWL model extraction and OWL instance generation can be performed in parallel and without the need for intermediate XSLT documents. Schema consolidation can comprise collecting schema documents, merging schema documents, and reorganizing the merged schema document to create a consolidated schema document.

Abstract: Sequential media reclamation is usually performed after portions of a sequential access volume's data are no longer needed and the unused portion of the volume exceeds a threshold. Improved sequential media reclamation is provided by using a sequential access disk volume (for example, a volume of a virtual tape library (VTL)) embodied as a sparse file. Reclamation of objects stored in the volume is accomplished by nulling out regions of the sparse file that contain the objects that are no longer needed. A replication method is also provided in which information about the objects stored in the sparse file (such as offset and length) is used during replication to enable the correct portions of a target volume (embodied as a sparse file) to be nulled out to match a source volume (also embodied as a sparse file).

Abstract: A computer-implemented data processing system and method for storing a data set at a plurality of data centers. The data centers and hosts within the data centers may, for example, be organized according to a multi-tiered ring arrangement. A hashing arrangement may be used to implement the ring arrangement to select the data centers and hosts where the writing and reading of the data sets occurs, version histories may also be written and read at the hosts and may be used to evaluate causal relationships between the data sets after the reading occurs.

Abstract: A system and method are disclosed for rendering published documents tamper evident. Embodiments render classes of documents tamper evident with cryptographic level security or detect tampering, where such security was previously unavailable, for example, documents printed using common printers without special paper or ink. Embodiments enable proving the date of document content without the need for expensive third party archival, including documents held, since their creation, entirely in secrecy or in untrustworthy environments, such as on easily-altered, publicly-accessible internet sites. Embodiments can extend, by many years, the useful life of currently-trusted integrity verification algorithms, such as hash functions, even when applied to binary executable files. Embodiments can efficiently identify whether multiple document versions are substantially similar, even if they are not identical, thus potentially reducing storage space requirements.

Abstract: Methods, systems, and computer program products are provided for query expression evaluation for query optimization. Embodiments include receiving a query including a plurality of predicates; creating a truth table representing the possible solutions to the query; identifying a plurality of intersections of the truth table, the plurality of intersections including each predicate of the query; assigning a selectivity factor to each predicate; determining in dependence upon the selectivity factors for each predicate a selectivity rating for each of the intersections of the truth table; selecting one or more of the intersections in dependence upon the selectivity rating; and determining in dependence upon the selected intersections a percentage of rows in a database table returned by the query; and providing the percentage of rows in the database table to an access plan generator for query optimization.

Abstract: A video retrieval system is proposed that retrieves trajectory data from a database as a response to a search query. The search query is formulated on the basis of a search trajectory, which is represented as a plurality of search segments. Minimum hounding areas are generated, whereby the plurality of the minimum hounding areas cover the search trajectory or at least one of the search segments. The video retrieval system accesses the database by using at least one of the minimum bounding areas as a query area, whereby the minimum bounding areas of the plurality of bounding areas are arranged overlap-free and/or adjacently or with a search trajectory independent overlap.