Abstract: Various technologies and techniques are disclosed for supporting parallel nested transactions in a transactional memory system. Multiple closed nested transactions are created for a single parent transaction, and the closed nested transactions are executed concurrently as parallel nested transactions. Various techniques are used to ensure effects of the parallel nested transactions are hidden from other transactions outside the parent transaction until the parent transaction commits. For example, versioned write locks are used with parallel nested transactions. When a transactional memory word changes from a write lock to a versioned write lock, an entry is made in a global versioned write lock map to store a pointer to a write log entry that the versioned write lock replaced. When the versioned write lock is encountered during transaction processing, the global versioned write lock map is consulted to translate the versioned write lock to the pointer to the write log entry.

Abstract: Methods and systems are provided for processing social media data. The method includes receiving a request from a user for social media analytics of social media data; sending the social media data to a first analytics provider and a second analytics provider; receiving first analytics data from the first data analytics provider and second analytics data from the second analytics provider; storing the first analytics data and the second analytics data in a database; and presenting the first analytics data and the second analytics data to the user.

Abstract: Methods, systems, and apparatus for processing data, and more specifically to retrieving results for a query from one or more devices coupled to a network. A first device may receive an abstract query including logical fields defined by a first data abstraction model and retrieve query results stored in the first device. The query may be sent to one or more other devices via the network. The one or more other devices may be configured to convert the abstract query to local abstract queries including logical fields defined in local data abstraction models. The local queries may be issued against local databases to retrieve additional results for the query. The local queries may not include all the fields of the abstract query.

Abstract: A data simulator receives a set of directives specified in a file and creates one or more datastreams from which a data structure may be built as specified by the directives. The directives may specify configuration settings, constants, changing fields, values and probabilities.

Abstract: Methods and device are disclosed for data retrieval. At first images and reports are analyzed by respective parser units to detect both structures and text passages that are related to respective structures and text passages of a knowledge data-base. The detected structures and text passages are stored together with a unique resource located that identifies the respective structure and/or text passage at the knowledge database in a semantic annotation database. In addition a feature extraction can be performed to provide specific features of the images and/or regions of the images, whereby the features are stored in an image feature database. Finally an input query can ask questions that are used to provide a result to the query based on the semantic annotation database and the image feature database. The methods and devices may be used for data preparation and data retrieval of medical images and associated medical reports.

Abstract: A network architecture with load balancing, fault tolerance and distributed querying comprises a plurality of front-end servers, a plurality of back-end servers, and a database. The front-end servers are coupled to a network to receive data requests from client devices. The front-end servers are each coupled to the plurality of back-end servers. The front-end servers handle data requests at a macro level and divide the request into sub-requests that are sent to the plurality of back-end servers. The back-end servers are coupled to the database to retrieve data. Each data request is distributed across the plurality of back-end servers according to workload. The front-end servers are fault tolerant in that they can respond to a request for data without all of the back-end servers being responsive or providing data.

Abstract: Provided are an apparatus and method for recovering a cursor position without degrading performance of a display apparatus. The apparatus includes: a cursor information storage unit that stores cursor information, which includes position information of a first cursor, in response to a cursor information storage message; and a cursor position recovery unit that recovers a position of a second cursor, which corresponds to the first cursor, by using the stored cursor information in response to a cursor information recovery message.

Abstract: A method and apparatus for generating at least one data record in respect to a database query comprising a fetch command. A database may be updated according to the at least one data record. In an exemplary embodiment, a database management system may be tested by performing the database query against the database. In another exemplary embodiment, a data record that satisfies the database query is generated in order to increase coverage when testing a database management system.

Abstract: A search request control apparatus includes a processor to execute a process. The process includes splitting a search request set, which contains a plurality of search requests acquired in a predetermined period, into subsets in accordance with a degree of overlap of data searched by each of the search requests, calculating an average response of the search requests contained in the search request set in accordance with a processing order of the subsets that are obtained through the splitting, and processing collectively in accordance with the processing order, search requests contained in a plurality of subsets having a minimum average response calculated.

Abstract: Data, such as product data or airline flight data, is represented using structured data tuples, tables, or as data with related metadata and tags, and stored by a search engine. Partial queries are received by the search engine from a user and are used to generate a dialog between the search engine and the user. The dialog may include suggested query completions for the partial queries that correspond to a schema associated with the data tuples. The suggested query completions may be determined using attribute combinations of attributes and attribute values, or metadata and tags associated with the data tuples, including known synonyms and misspellings. The user may interact with the query completions in the dialog, and the search engine may revise the dialog and the query completions according to the interactions. A user may query data tuples without knowing the schema used by the underlying data structures.

Abstract: Accessing results of calculations on multidimensional data using relational database statements, such as SQL commands, involves a relational database server communicating with a multidimensional database server to cause the multidimensional database server to extract, and to perform calculations on, the multidimensional data. In response to a relational database statement in a language supported by the relational server, which includes an expression of an operation on the multidimensional data in a language supported by the multidimensional server, the multidimensional server extracts the required multidimensional data, performs the requested operation (e.g., an OLAP DML operation) on the data according to the specified expression, and provides results of the multidimensional operation to the relational database server.

Abstract: In processing a query on multidimensional data in a multidimensional schema, a multidimensional database server performs various processes to limit the amount of data that is extracted from the database and presented to a relational database server in response to the request. A subset of data is identified to extract from the multidimensional data, based on the query. In various embodiments, cell-filtering, measure-filtering, and column-filtering criteria identified from the query are used to filter the subset of data, in order to return a minimized set of multidimensional data values from the subset of data. Therefore, computational resources are conserved with respect to further processing by the relational database server in response to the query.

Abstract: Methods and system of searching for content in a target set of content based on a reference set of content, a reference semantic network representing knowledge associated with the reference set of content, and a target semantic network representing knowledge associated with the target set of content.

Abstract: Legacy database engines may be extended through the use of callback extension handlers on the client. For example, regular expression matching and arbitrary user-functions may be implemented in a legacy database engine without replacing the engine. A pattern string may be provided to the legacy database engine by a client with a pattern matching prefix. When the legacy database engine encounters the prefix, the database engine executes a callback to the client with a value from the database for pattern matching. The client performs the pattern matching through, for example, regular expressions, and returns a match status to the database engine. The process may be repeated for several rows of a table in the database and a dataset compiled by the database engine and returned to the client.

Abstract: An XML querying method and system for constructing an XQuery/XPath query to a schema variable XML document. The method includes: receiving the query from a client computer; generating a tree structure; and generating, by query rewriting, an XQuery/XPath for the XML document based on the tree structure and configurable query constraints. The system includes: a tree structure generating unit for generating a tree structure; and a query writing unit for generating an XQuery/XPath query for the XML document based on the tree structure and configurable query constraints.

Abstract: Systems and methods for managing data, such as metadata. In one exemplary method, metadata from files created by several different software applications are captured, and the captured metadata is searched. The type of information in metadata for one type of file differs from the type of information in metadata for another type of file. Other methods are described and data processing systems and machine readable media are also described.

Abstract: A method for processing queries is provided. A database server receives and executes a query to generate a relation. The query comprises first one or more clauses and a model clause. The model clause comprises a rule that has a left-side expression and a right-side expression. In one embodiment, the right-side expression of the rule includes a window function, which specifies one or more partition columns. In an embodiment, the left-side expression comprises a for-loop predicate. The for-loop predicate is unfolded after the database server compiles the query. In one embodiment, the left-side expression of the rule comprises one or more existential predicates, where each existential predicate evaluates to a Boolean value.

Abstract: A system and method for implementing a metadata search interface is disclosed. The technology creates a configuration file for the metadata search interface comprising a predicate describing a search parameter of the metadata search interface. The configuration file further comprises a control attribute which associates the predicate with a control describing how a display element displayed on the metadata search interface is displayed and a correlation between the display element and the predicate. The technology further comprises generating the metadata search interface in runtime based upon the control.

Abstract: A database processing apparatus generates a first processing instruction for acquiring an element included in the processing-target structured document, a second processing instruction for performing a natural join by using result data including the acquired element, a third processing instruction for performing a cross join by using the result data, and a fourth processing instruction for updating a correspondence relation between a result of the execution of the natural join and a result of the execution of the cross join by using these result of executions, and joins these processing instructions to generate the process plan. At this time, the database processing apparatus converts the first processing instruction into a fifth processing instruction for transmitting an acquisition request for the element to the database servers, and receiving the result data including the acquired element from the plural database servers.

Abstract: The present invention is directed towards systems and methods for updating a search results page in response to user interaction with a map resource. The method of the present invention comprises receiving a first search results page in response to a search query comprising at least a first map resource. The method monitors a change in position of a map resource in response to a user interaction and calculates a location corresponding to a map position. The method then re-executes at least one search query based upon said calculated location and displays a second search results page comprising a plurality of updated search results.

Abstract: Techniques are provided for improving efficiency of database systems, and in particular, to refreshing materialized views maintained by database systems and rewriting queries to access the materialized views. According to the approaches, a ranked materialized view is incrementally refreshed, and during the incremental refresh operation, rows in the partitions of the materialized view are ranked within the partitions.

Abstract: The present disclosure includes a system and method for determining proximity to topics of content items (e.g., an advertisement or “ad”). In some implementations, a method includes identifying search criteria associated with keywords of a content item. The keywords used in determining whether or not to embed the content item in Web pages including search results. Numerical scores for the search criteria is determined based, at least in part, on a topic of the content item, the numerical score indicative of proximity to the topic of the content item.

Abstract: A method, system and program product for specifying, in a schema mapping framework, a mapping between a source schema and a target schema. The source and target schemas are schemas included in respective groups of registered, heterogeneous schemas. The source and target schemas may be of different types. Serialized versions of the source and target schemas include source objects and target objects, respectively. A mapping model is serialized into mapping objects that include logical references representing the source objects and logical references representing the target objects. The logical references are resolved to the source objects and target objects, thereby storing pointers to the source objects and to the target objects. After resolving the logical references, the mapping model includes the logical references and the pointers to the source and target objects.

Abstract: A continuous query parallel engine on data streams provides scalability and increases the throughput by the addition of new nodes. The parallel processing can be applied to data stream processing and complex events processing. The continuous query parallel engine receives the query to be deployed and splits the original query into subqueries, obtaining at least one subquery; each subquery is executed in at least in one node. Tuples produced by each operator of each subquery are labeled with timestamps. A load balancer is interposed at the output of each node that executes each one of the instances of the source subquery and an input merger is interposed in each node that executes each one of the instances of a destination subquery. After checks are performed, further load balancers or input managers may be added.

Abstract: An apparatus and a method in a portable terminal allow searching for content and provide a function which re-searches and classifies the searched content based on a time line. A 4D data search unit outputs a time setting menu for changing a time line after searching for content corresponding to a keyword, and re-searches for the searched content based on the changed time line that corresponds to a rotation of the time setting menu.

Abstract: Methods, systems, and apparatus for processing data, and more specifically to retrieving results for a query from one or more devices coupled to a network. A first device may receive an abstract query including logical fields defined by a first data abstraction model and retrieve query results stored in the first device. The query may be sent to one or more other devices via the network. The one or more other devices may be configured to convert the abstract query to local abstract queries including logical fields defined in local data abstraction models. The local queries may be issued against local databases to retrieve additional results for the query. The local queries may not include all the fields of the abstract query.

Abstract: Architecture which provides that certain data-bound objects in the report can be configured by the report author to use data from a specific query result rather than take data from the containing data bound object. The report author defines a relationship between the data in the contained object and the data in the container, allowing instances of the descendant object to be correlated with instances of the ancestor object. This relationship can be either explicit with join conditions or implicit due to an intrinsic hierarchical relationship between the query results.

Abstract: A method and a system process a stream of data in parallel across a plurality of nodes. The log processing system has a log module, a query language module, and a query processing module. The log module receives and organizes the stream of data into a sequential and nested data structure. The query language operator module defines operators that operate on the sequential and nested data structure. The query processing module processes in parallel across a plurality of nodes a query based on an operator on the stream of data.

Abstract: A computer server system may include a plurality of database modules for storing user data for a plurality of users, and at least one processing module comprising a plurality of processing threads for processing jobs for users based upon respective user data. The computer server system may further include a database pool module connected between the plurality of database modules and the at least one processing module. The database pool module may be for selectively connecting the processing threads to corresponding database modules including respective user data for jobs to be processed, and determining when a database module becomes unresponsive and terminating processing thread connections to the unresponsive database module based thereon. The database pool module may also be for determining when the unresponsive database module becomes responsive and restoring processing thread connectivity thereto based thereon.

Abstract: One particular embodiment accesses a first set of search queries comprising one or more first search queries; extracts one or more features based on the first set of search queries, trains a search-query classifier using the features; accesses a second search query provided by a user; determines whether the second search query has implicit and general local intent using the search-query classifier; if the second search query has implicit and general local intent, then determines a location associated with the user; and identifies a search result in response to the second search query based at least in part on the location associated with the user; and presents the search result to the user.

Abstract: Techniques are provided for performing transaction-aware caching of metadata in an electronic file system. A mechanism is described for providing transaction-aware caching that uses a cache hierarchy, where the cache hierarchy includes uncommitted caches associated with sessions in an application and a committed cache that is shared among the sessions in that application. Techniques are described for caching document metadata, access control metadata and folder path metadata. Also described is a technique for using negative cache entries to avoid unnecessary communications with a server when applications repeatedly request non-existent data.

Abstract: The present invention provides a computer method and system for querying or searching for at least one data file corresponding to a query definition. A first query is received which may provide a query definition that may be used as a scope of search for a second query. Modifications of the scope of search based on modification of the first query may be automatically reflected in the scope of search for the second query. The scope of search for the second query may further be a combination of a plurality of scopes based on a plurality of user-defined queries.

Abstract: Improved techniques for enhancing, associating, and linking various sources of metadata for music files, to allow integration of commercially generated metadata with user-entered metadata, and to ensure that metadata provided to the user is of the highest quality and accuracy available, even when the metadata comes from disparate sources having different levels of credibility. The invention further provides improved techniques for identifying approximate matches when querying metadata databases, and also provides improved techniques for accepting user submissions of metadata, for categorizing user submissions according to relative credibility, and for integrating user submissions with existing metadata.

Abstract: Managing queries performed on one or more data sources includes: storing at least a first query in a storage medium; selecting the first query for processing; instructing a query engine to process the first query on a first portion of data in the one or more data sources for a first query interval; receiving result data from the query engine based on processing the first query on the first portion of data; saving a state of the first query in the storage medium after the first query interval; instructing the query engine to process a second query during a second query interval after the first query interval; and instructing the query engine to process the first query on a second portion of data in the one or more data sources during a third query interval after the second query interval.

Abstract: Techniques are described herein for classifying a search query with respect to query intent using search result tag ratios. A tag is a character or a combination of characters (e.g., one or more words) that indicates a property of a document, such as a topic of the document, a type of entity (i.e., subject matter) the document references, etc. A search result tag ratio is defined as a fraction (e.g., a proportion, a percentage, etc.) of the documents in a search result that includes a respective tag. A search query may be classified based on back-off ratios, which are tag ratios of search queries that are related to the search query to be classified. Tag ratios may be pre-computed (i.e., calculated before the corresponding search queries are received from users).

Abstract: A new database design is implemented in which everything in the database is modeled with primitives, including the links and nodes for a graph tuple store. A query syntax provides a nested tree of constraints with a single global schema. Various optimization techniques for queries and replication techniques are also 10 described.

Abstract: The processing of a query that is submitted to a central controlling server where the central controlling server sources data from one or more backend databases and where such data is referenced by subqueries associated with the query is disclosed.

Abstract: A system for retrieving data from a plurality of data sources is provided. The system includes a first data source for storing first data, a second data source for storing second data, and a server computer in communication with the first and second data sources. The server is programmed to receive a query execution request including a query definition reference and a query parameter definition wherein the query definition reference corresponds to a query definition that includes a first query block and a second query block, create a first executable query based on the first query block and the query parameter definition, create a second executable query based on the second query block and the query parameter definition, execute the first executable query at the first data source to create first query results, and execute the second executable query at the second data source to create second query results.

Abstract: A group join query facilitates navigation of relationships (e.g., one-to-many or many-to-one) across a plurality of data collections. Such a query operator produces nested or hierarchical results that capture the arguments passed thereto. If desired, the nested results can be flattened to simulate conventional relational database results.

Abstract: Provided are methods of performing a database search using relevance feedback, in which a ranking scheme is applied to a database system for efficient database search, and a recording medium having a program recorded thereon for executing the same. The method includes receiving relevance feedback for a first search result, deriving a relevance function based on the received relevance feedback, and applying the first search result to the relevance function and providing a second search result ordered according to a relevance level. Accordingly, an accurate relevance function can be derived from a small amount of feedback by using relevance feedback and a ranking scheme, such that an efficient database search can be achieved without a user reviewing all search results to obtain a desired result.

Abstract: A database server contains pointers to useful information, such as on the World Wide Web. Users of the server may have hypertext links added automatically into documents they submit. Users may additionally contribute to the link database, thereby extending it, and may add additional qualifying information pertaining to the links.

Abstract: Techniques for producing a cross tabulation are described. The techniques involve issuing a plurality of queries to a database. The queries are for each of at least one sublevel of data for each of at least one dimension of data associated with records in the database. The queries provide sublists of sorted identifiers for each one of the queries. The technique determines occurrences of intersections of levels of one dimension with levels of another dimension of the data associated with records in the database by traversing the sublists to detect intersections of the dimensions.

Abstract: Hardware assisted transactional memory system with open nested transactions. Some embodiments described herein implement a system whereby hardware acceleration of transactions can be accomplished by implementing open nested transaction in hardware which respect software locks such that a top level transaction can be implemented in software, and thus not be limited by hardware constraints typical when using hardware transactional memory systems.

Abstract: A meta classification section assigns the degree of accuracy capable of identifying an individual to person feature information containing a face, color, shape, etc., and person passage information and stores the metadata of the person feature information and the person passage information for each degree of accuracy, a discrete retrieval section retrieves the person to be retrieved in the high accuracy metadata stored by the meta classification section, a dependence determination section determines a person having a dependence on the person to be retrieved using a plurality of retrieval results hit in the discrete retrieval and the high accuracy metadata, a query generation section regenerates a retrieval key from the identifier of the person having a dependence and the identifier of the person to be retrieved, and a discrete candidate-to-candidate retrieval section retrieves the person corresponding to the regenerated retrieval key in the low accuracy metadata.

Abstract: A computer implemented method for generating nucleotide sequences containing candidate homing endonuclease genes (HEGs). A search is performed in a database stored on a storage medium of nucleotide sequences for amino acid sequences having a subsequence having a homology level with the translation of a subsequence of one or more predetermined HEGs. For each amino acid sequence generated by the search, one or more nucleotide sequences are retrieved encoding the amino acid sequence. The results of this search used in a second search of a database stored on a storage medium to generate the HEG containing sequences.

Abstract: This disclosure provides various embodiments of systems, methods, and software for managing distributed index data. For example, in one embodiment, software for managing distributed index data may identify a query for one or more data objects from a data repository using a generic index, map the query to one of a plurality of logically distributed indices according to at least one rule, and execute the mapped query using the particular distributed index to retrieve the one or more data objects. Each distributed index may be in a disparate index repository that is on a disparate storage device. In some aspects, the one or more rules may include a plurality of business rules, as well as at least one technical rule, which may be stored in a rules repository. In further aspects, an administration view may be presented to a client such that one of the business rules is customized.

Abstract: A system, method and article of manufacture for data processing and, more particularly, for managing execution of complex data access operations in a data processing system. One embodiment provides a method of managing execution of query operations in a data processing system. The method comprises issuing, by a requesting entity, a request to perform a composite query operation defining an initial query operation and a subsequent query operation to be executed against a data repository of the data processing system, executing the initial query operation, determining an operation status of the initial query operation, and managing execution of the subsequent query operation on the basis of the determined operation status.

Abstract: A mechanism and method for querying between two data centers managed by two different data center management products is described. A single information query model is utilized to query multiple instances of another data center, which receives, translates and responds to the information query through the use of a schema. Knowledge of the other (foreign) data center's APIs for each instance is made unnecessary. Improved query efficiency is achieved by combining a plurality of disparate queries into a single information query. The responses to the plurality of queries are populated into a single reply to the information query, which is then transmitted back to the querying data center, translated and made readable to the IT administrator.

Abstract: Querying a compound XML document having a primary XML document and multiple nested documents may be performed in a single query. The single query comprises an expression of at least one attribute and the encoding type of the nested documents. Execution of the query involves decoding each nested document according to its encoding type and searching for the attribute specified in the query. The results returned from each of the nested documents may be combined with the results returned from the primary document before returning the results to the user.

Abstract: System and method for notifying a user of an occurrence of a defined condition in a process. The process includes a plurality of event records associated with the process; each of the plurality of event records includes a plurality of data fields having data relating to the process. A subset of the plurality of event records is defined where the subset relates to the defined condition. The data in the defined subset is updated at a predetermined time interval. The user is notified when the updated data of the defined subset indicates that the defined condition has occurred. The subset may alternatively be defined as a function of a current time, a last run time and the defined condition.