Abstract: The claimed subject matter provides a system and method for automatic allocation of tenants to database services. An exemplary method comprises determining a query plan based on a workload for each tenant. A distance metric is created based on the query plan for each tenant, and tenants are clustered based on the distance metric into a predetermined number of clusters which is equal to the predetermined number of databases.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to subscribing and updating nodes within XML documents and provide a novel and non-obvious method, system and computer program product for matching various combinations of XML Path Language (XPATH) Uniform Resource Identifiers (URIs). In one embodiment of the invention, a method for matching various combinations of XML Path Language (XPATH) Uniform Resource Identifiers (URIs) that includes receiving a XPATH expression for a node in an XML document, retrieving the node identified by the XPATH expression, determining if a template exists for the identified node, where the template resides in a database of a document management system, comparing the template expression to the XPATH expression and determining if the expressions match.

Abstract: A method including extracting data spanning a computational interval from a plurality of database tables in an optimized manner, creating an array of each column of data that is extracted, accessing each array via a standardized programmatic interface to manipulate the data, if needed to perform computations, normalizing the accessed data to a common interval or interpolating the accessed data to derive missing items based on the common interval, performing the computations on the accessed data, and outputting results of the computations to a storage medium or an output device. A corresponding system and computer program product.

Abstract: Computer system navigation tools provide “links” to various different files, lists, folders, and/or other storage elements and allow users to organize files, e.g., by hierarchical properties, lists, auto lists, folders, and the like. Such systems and methods allow users to assign properties to a file (optionally in a hierarchical manner), to change assigned properties, to search, view, and retrieve information based on the assigned properties, and the like.

Abstract: Embodiments of the invention provide methods, systems, and articles of manufacture improving the process of query composition, query processing, and presenting query results to users of an abstract database. Embodiments of the present invention organize and view data using abstract records. Specifically, users compose a query according to the logical relationships present in the data. Rather than evaluate conditions against a set of rows from a relational table, conditions included in abstract query are evaluated against instances of an abstract record. Instances that satisfy the conditions specified by an abstract query are returned as query results. In a specific case abstract records are used to evaluate a “never exists conditions, that determine the absence of data in an abstract records that satisfy a particular condition.

Abstract: Flattening a relational database. A method includes accessing a first database table. A first entry value is identified in a first entry from the first database table. The first entry value represents a plurality of entry values of corresponding entries in a second database table. An array is created that includes one or more representations of the plurality of entry values. At least a portion of the first database table is converted to one or more hierarchical record documents, with columns of the first database table represented at a first hierarchical level and values in entries in the columns represented at a second hierarchical level below the first hierarchical level for a corresponding column. Converting the first database table to one or more hierarchical record documents includes substituting the array in a hierarchical record document for each entry in the plurality of entries having the first entry value.

Abstract: Technologies are generally described for a peer to peer search routing algorithm and system. In one example, a node in a peer to peer network includes a processor. In some examples, the processor may be configured to receive information regarding a topology of the peer to peer network and generate a first search routing algorithm for the peer to peer network based on the topology. In some examples, the processor may be configured to generate a second search routing algorithm for the peer to peer network based on a search characteristic and the topology. In some examples, the second search routing algorithm is distinct from the first search routing algorithm. In some examples, the processor may be configured to receive a request to search the peer to peer network. In some examples, the processor may be configured to search the peer to peer network using the second search routing algorithm.

Abstract: Methods, systems and computer program products for pathing analysis are provided. The method includes receiving at a server, a query comprising one or more nodes. The method further includes identifying one or more prior queries, wherein the one or more prior queries comprise at least one of the one or more nodes. The method accesses metadata associated with the one or more prior queries. The method then selects based on the metadata, one or more data partitions for further processing. Next, the method causes one or more computers to identify one or more paths in the selected data partitions, wherein the one or more paths comprise at least the one or more nodes. Finally, the method presents the identified paths as an output to the query.

Abstract: A computer implemented method, apparatus, and computer usable program code for detecting monotonicity. A determination is made as to whether a function that is assumed to be monotonic will remain monotonic after performing an operation in response to receiving the operation. The operation is allowed to be performed in response to a determination that the function will remain monotonic after performing the operation.

Abstract: Methods, systems and computer instructions on computer readable media are disclosed for optimizing a query, including a first join path, a second join path, and an optimizer, to efficiently provide high quality information from large, multiple databases. The methods and systems include evaluating a schema graph identifying the join paths between a field X and a field Y, and a value X=x, to identify the top-few values of Y=y that are reachable from a specified X=x value when using the join paths. Each data path that instantiates the schema join paths can be scored and evaluated as to the quality of the data with respect to specified integrity constraints to alleviate data quality problems. Agglomerative scoring methodologies can be implemented to compute high quality information in the form of a top-few answers to a specified problem as requested by the query.

Abstract: A method and apparatus for preserving optimization hints in a transformed query is provided. In one embodiment, the methodology is implemented by query optimization logic. Upon receiving a first query to access values in a column of a table protected by an access control policy, the query optimization logic creates a second query that is equivalent to the first query as subject to the access control policy. Furthermore, the second query contains a new predicate that conjunctively joins a clone of a first expression in a predicate of the first query with a second expression that is derived, based on the access control policy, from the first expression. In one embodiment, the query optimization logic submits the second query for execution.

Abstract: A system in which a plurality of performance objects are stored in computer memory, where each performance objects contains at least one input template and a corresponding optimized code path program product. A template matcher intercepts an input set destined to a directory server, and then determines a match between the intercepted input set and one of the templates. A code path selector then retrieves the corresponding optimized code path program product stored in a performance object associated with the matched template. Finally, a code processor executes the retrieved optimized code path program product on the intercepted input set, and stores the result in a tangible computer media through alteration of a physical property of the media.

Abstract: Methods and apparatus consistent with the invention provide improved organization of documents responsive to a search query. In one embodiment, a search query is received and a list of responsive documents is identified. The responsive documents are organized based in whole or in part on usage statistics.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for storing a formula having first and second object fields. These mechanisms and methods for storing a formula having first and second object fields can allow access to data from related object types other than the object type being currently accessed. The ability of embodiments to provide such access may allow access to additional contents of a database for performing validations, calculations, etc.

Abstract: An assisting method and an assisting apparatus for accessing a markup language document are provided. First, an intermediate table is established in a storage unit, wherein the intermediate table includes a length field, a depth field, a type field, a parent element field, and an offset field. Then, structure data of each element in the markup language document is transformed into the intermediate table to respectively record a string length, a hierarchy depth, an element type, a parent element index, and an absolute position of the element into the length field, the depth field, the type field, the parent element field, and the offset field. Finally, access to the markup language document is assisted according to the intermediary table.

Abstract: Methods for transforming queries that contain EXISTS and NOT EXISTS subqueries are provided. The methods provided transform original queries that contain EXISTS and/or NOT EXISTS subqueries in conjunctive or disjunctive combinations into transformed queries that coalesce the original EXISTS and/or NOT EXISTS subqueries into a reduced number of EXISTS and/or NOT EXISTS subqueries, thereby eliminating duplicative table accesses and join operations.

Abstract: In one embodiment the present invention includes a method comprising receiving a data filter for filtering a collection of data, wherein the collection of data is configured as a star schema including a fact table and dimension tables. The data filter is applied against the dimension tables to generate a modified dimension table. The modified dimension tables are applied against the fact table to produce a modified fact table. The data filter is then applied against the modified fact table to generate a second modified fact table, which is the output of the process.

Abstract: A system for associating information related to a component of a structured document that is stored in its native format in a database system includes generating a hierarchical node tree comprising a plurality of nodes, where each node represents a component in the structured document, and generating a path associated with each node, where the path follows the hierarchical structure of the structured document from a root node to the node. In each node, an identifier associated with the path is stored. A table is provided that correlates the identifier with information related to the associated path. The information applies to the component represented by the node.

Abstract: A method, computer program, and database system are disclosed for processing a database query that includes one or more expressions. The method includes resolving columns in one or more of the expressions. Expression optimization is performed on one or more of the expressions. Afterward, further query optimization is performed.

Abstract: A method and system for eliminating unnecessary statistics collections for query optimization in a database stored on a computer. Statistics are unnecessary when a re-generated query execution plan that does not use the statistics is equivalent to an original query execution plan that uses the statistics. To determine this, an original query execution plan is created for each query in a specified workload using the statistics in the database. A search is performed of the statistics in order to enumerate one or more candidate sets of statistics to be eliminated. One or more of the candidate sets of statistics are removed from consideration prior to creating the re-generated query execution plan for each query in the specified workload.

Abstract: This document describes tools capable of updating media-location data for media-playing entities. These tools allow a developer of an application to use data binding to update media-location data for the media-playing entities without the need to write custom code.

Abstract: A method for controlling a relational database system by executing a database query in a relational database which contains, as an associated data structure, a plurality of data tables interconnected through relations, by using a database language, with a table of the relations being provided. A processable database statement without relation-related operations is created by indicating the data tables to which the processing functions are to be applied and by indicating the order of the selected data tables according to which the processing is to be carried out, and an access path, which concretely states the order of access to the database, is determined by first computing a partial access path, via the table of relations, between each two subsequent, selected data tables on the basis of the relations which exist between the subsequent data tables, and then assembling the access path from all computed partial access paths.

Abstract: An apparatus and method for optimizing descendant path evaluation in XPath/XQuery includes generating a list of unique paths in a tree structure of an XML document. Each unique path includes one or more nodes of the tree structure. A query is received specifying a descendant node for retrieval from the tree structure. From the list, unique paths are identified that include the descendant node. A navigation aid is then generated to assist in traversing the unique paths that include the descendant node. Using the navigation aid as a guide, descendant nodes in the tree structure may be retrieved by traversing only unique paths that include the descendant node.

Abstract: A method of query pattern matching uses a chain of linked stacks to compactly represent partial results to root-to-leaf query paths, which are then composed to obtain matches for the twig pattern.

Abstract: Structural join mechanisms provide efficient query pattern matching. In one embodiment, tree-merge mechanisms are provided. In another embodiment, stack-tree mechanisms are provided.

Abstract: Evaluation of Multiple XPath Queries in a Streaming XPath Processor. A hit of a location path is determined in a SAX event. All XPath queries corresponding to the location path are then identified. XML nodes associated with the SAX event is identified as potential output nodes for all XPath queries including the location path as a main location path. The potential output nodes are nodes satisfying criteria of a node test of a last location step of the main location path. The potential output nodes are then buffered for all XPath queries comprising unevaluated predicates. For each XPath query the potential output nodes are buffered at a location step including an unevaluated predicate. Thereafter, all XPath queries are evaluated by progressively evaluating the unevaluated predicates of all XPath queries based on availability of data.

Abstract: A computer-implemented method for protecting active copies of data may include detecting an attempt to access an active copy of original data, identifying an access rule associated with the original data, and determining whether to allow access to the active copy by applying the access rule to the attempt to access the active copy. The computer-implemented method may also include associating the access rule with a file-system path of the active copy. The access rule may be a file-system rule associated with a file-system path of the original data. Various other computer-implemented methods, systems, and computer-readable media for protecting active copies of data are also disclosed.

Abstract: A data providing system for distributing content data from a data providing apparatus to a data processing apparatus and managing said data providing apparatus and said processing apparatus by a management apparatus. In the system, the management apparatus is configured to provide a key file in which is stored content key data and usage control policy data indicating a content of rights, including permission conditions of the content data. At least a part of said key file is encrypted. The data providing apparatus is configured to provide the content data encrypted by using the content key data stored in the key file. The data processing apparatus is configured to decrypt the key file to obtain the content key data from the key file and determine handling of the content data based on the usage control policy data stored in the key file.

Abstract: In one aspect, two ways of accessing a content unit stored on a CAS are provided, wherein the content unit has a content address that is computed based, at least in part, on at least a portion of its content. A first interface is provided to a file system in which the content unit is logically stored as a logical unit identified by a logical identifier, wherein the content unit is accessed in response to a request to the first interface to access the logical unit and identifying the content unit via the logical identifier. A second interface is provided through which the content unit can be accessed via the content address, wherein the content unit is accessed in response to a request to the second interface to access the content unit and identifying the content unit by the content address.

Abstract: The claimed subject matter provides systems and/or techniques that effectuate combining domain-tuned search systems. The system can include mechanisms that obtain queries, written descriptions, or illustrative web-pages regarding a particular area of interest, and generate a definition related to the area of interest. The definition contains a list of paths with associated weights employed to identify an pre-established first domain-tuned search system related to the area of interest. The first domain-tuned search system thereafter can be combined with a second domain-tuned search system related to another area of interest and presented to a user for utilization in re-ranking generic search results to be specific to the first and second domains of interest if combined, or to only the first domain if weights for the second domain are logically subtracted.

Abstract: A table lookup indexing system for the transmission of data packets in a network switch. Data is received in an input port and is divided into two parts, an index portion and a bucket portion. The index portion selects a particular bucket and the combination of the index portion and bucket portion selects a specific entry in the table.

Abstract: A query of at least one mark-up language document has a path expression comprising a conjunction, a first filter and a second filter. The first filter has a first probe. The second filter has a second probe. The first and second filters form a between filter having start and stop values specified by the first and second probes. A plan to process the query is generated based on, at least in part, a range defined by the start and stop values. An index of mark-up language documents is defined by another path expression; the index comprises values of mark-up language documents that satisfy the other path expression; the values are key values of the index. The plan is to perform a single scan of the key values from the start value to the stop value to identify at least one key value that satisfies the between filter.

Abstract: Queries that request fields that are contained in the same XML fragments are written to execute them more efficiently.

Abstract: In a method, system, and computer-readable medium having instructions for optimizing a query in a database system, a database statistic is generated for a number of related records for one or more entities for at least one tenant and a related record is a record with a relationship to a shared record in a database table for an entity from the one or more entities, a first cost is calculated for accessing the number of related records for at least one tenant, a second cost is calculated for accessing a number of related records accessible to a user, a comparison of the first cost to the second cost is performed to determine a data access path for retrieving accessible related records, and the data access path for retrieving accessible related records is determined based upon the comparison.

Abstract: A portable terminal, which has mail function, allows a user to input a destination address of mail by selecting the address from the address list with easy operation by displaying all of information for input operation of the destination address with other information for mail creation such as subject and message of the mail.

Abstract: Network security is enhanced in a multi-tenant database network environment using a query plan detection module to continually poll the database system to locate and raise an alert for suspect query plans. Security also can be enhanced using a firewall system sitting between the application servers and the client systems that records user and organization information for each client request received, compares this with information included in a response from an application server, and verifies that the response is being sent to the appropriate user. Security also can be enhanced using a client-side firewall system with logic executing on the client system that verifies whether a response from an application server is being sent to the appropriate user system by comparing user and organization id information stored at the client with similar information in the response.

Abstract: Disclosed herein is a method and apparatus for use in searching a geographic database to retrieve geographic objects one cell from a neighborhood of cells at a time. A cell neighborhood can be defined using a grid of cells and an initial, or center, point. A first neighborhood is identified based on its proximity to the initial search point, and corresponds to a first geographic area defined using the initial point and a distance from the initial search point in a number of directions. In a case that more than one cell neighborhood is used, each subsequent cell neighborhood is defined so that it excludes cells belonging to a previously-searched cell neighborhood. A subsequent neighborhood corresponds to a geographic area that is a distance from the initial point greater than the distance associated with a previously-searched neighborhood.

Abstract: A system, method and computer readable medium for synchronizing web content is disclosed. The method includes retrieving a first web content in a first language from a web site, the first web content corresponding to a second web content wherein the second web content is a translation in a second language of the first web content. The method further includes dividing the first web content into a plurality of translatable components and generating a unique identifier for each of the plurality of translatable components. The method further includes matching each of the plurality of translatable components to a plurality of translated components of the second web content using the unique identifier of each of the plurality of translatable components. If a translatable component is not matched to a translated component, the method further includes designating the translatable component for translation into the second language.

Abstract: Various embodiments are directed to a proxy system for implementing an automatic conversion schema which allows data results from a publishing application to be extracted and displayed by a display application other than the publishing application. In one embodiment, a proxy publisher may receive a request from a publishing application to retrieve a data result from a data server. The request may include a path to the data server and appended publishing parameters. In accordance with the automatic conversion schema, the publishing parameters may comprise decode parameters associated with the publishing application for allowing a display application other than the publishing application to decode variables of the data result and to transform the decoded variables for display. The proxy publisher may cache the request including the appended publishing parameters and retrieve the data result from the data server.

Abstract: A computer-implemented method and system for realizing an interactive, virtual bookshelf representing physical books and digitally stored books of the user. Using a search query, the Web is searched using search metadata to identify a desired book. Library metadata corresponding to the physical books and digitally stored books of the user is then searched using the search metadata to determine whether the desired book is present in the virtual on-line bookshelf. Results indicative of whether the desired book is present on the virtual on-line bookshelf can be displayed.

Abstract: Modifying Xpath queries dynamically during an ongoing Xpath evaluation. A modification request comprising at least one Xpath query in response to an input is received in an ongoing Xpath evaluation on an online stream of XML messages. A current generation of Nondeterministic Finite Automaton (NFA) is generated and the branches starting from the root node are identified according to the modification request. The identified branches are copied and modified to create a new generation of NFA. New generation of NFA is used for subsequent Xpath evaluations.

Abstract: Techniques that support trail-based exploration by a user of a repository of documents are described herein. In one embodiment, trail definition data that specifies a trail is received. The trail includes an ordered series of waypoints including a trailhead, intermediate waypoints, and one or more trailends. In some embodiments, deadends may also be defined in the trial. A particular waypoint in the ordered series of waypoints is established as a current waypoint. Search terms can be received from a user to cause a search to be performed. It is then determined whether the search satisfies matching criteria associated with a waypoint that immediately follows the current waypoint in the ordered series of waypoints. If so, the user advances to the next waypoint. Otherwise, the user remains at the current waypoint. Finally, if a trailend is reached, then an action such as rewarding the user in some way may be performed.

Abstract: Configurably storing data in a plurality of files based on expressions and conditions associated with the data. Logging software enables tracking of the navigation pattern of users for selected network properties under specified conditions. The logging software is configurable such that most current and future logging specifications may be fulfilled without any code changes to the logging software.

Abstract: Provided are a method and a system for managing a file metadata, which are independent of a address change of a data server and movements of a disk by using a location of disk where data exists actually as a location information of a file data. The method for managing the file metadata includes determining whether the request of the metadata is valid, verifying information of a disk storing a file data corresponding to the metadata and a data server address in which the file data exists, and transmitting the verified address of the data server to the client. According to the method and the system for managing the file metadata, data services can be continuously provided without modifications of a file metadata even if the data server address is changed.

Abstract: Some embodiments provide a method for processing metadata associated with digital video in a multi-state video computer readable medium. The method specifies a set of rules for propagating the metadata between different states in the video computer readable medium. It then propagates the metadata between the states based on the specified set of rules.

Abstract: Reducing access time for data in a file system when seek requests are received ahead of access requests. In one embodiment, an operating system providing access to the file system receives a seek request (from a user application) indicating an identifier of a file and a location within the file at which a data is sought to be accessed. In response, the operating system computes the offset of a disk block containing the location (thereby the data that is sought to be accessed). On receiving an access request (after the seek request from the same user application) indicating an operation to be performed on the data, the operating system executes the operation on the data using the pre-computed offset of the disk block. The computation of the disk block is performed before the access request is received thereby reducing the time required to process the access request.

Abstract: Methods, systems and computer-readable medium are provided for replicating the data fields used by relational join operations in transient or persistent data structures with explicit support for named relationships that may have 1:1, 1:many, many:1 or many:many cardinality. An algorithm is applied to predetermine the optional search path for finding relationships between any two rows of any of one or more tables, including relationships defined between other tables. The schema of a target relational database, either derived or input, is converted into an object-oriented schema that explicitly defines relationships between columns in the tables of the relational database and represents the tables as object classes. The schema is analyzed and optimal search paths are derived and stored for subsequent use. A query engine accesses the predefined search paths in order to execute the specific types of query listed above and incrementally populates instances of the transient or persistent structures.

Abstract: A generic Internet based system for viewing supply chain data is provided. The system includes an Internet based data viewing engine and a data store that holds both viewable data and metadata associated with the viewable data. The metadata can be employed by the Internet based data viewing engine to control the presentation of the viewable data. The generic Internet based supply chain data viewing engine may be employed in a virtual private supply chain (VPSC). A VPSC includes a data acceptor that can receive supply chain data items from supply chain members, a supply chain data store that can store transformed, validated supply chain data items received from the supply chain members and a data accessor operable to selectively present supply chain data items stored in the supply chain data store to viewing supply chain members. One example of the data accessor is the generic Internet based viewing engine.

Abstract: Novel methods for expressing paths contained in queries are provided. The path expressions are composed from tokens selected from the group consisting of object identifiers, attribute identifiers, a relationship operator, and path qualifiers. Path expressions can be more easily created than by creating the path expressions directly in SQL. The path expressions can easily be incorporated into queries for querying data structured according to an object model. Examples of such queries include queries for implementing rules for checking data corresponding to IT infrastructures to see if the IT infrastructure is compliant with policies created for the IT infrastructure.

Abstract: Mechanisms are provided for drilling on data elements in arbitrary ad-hoc reports. Data elements in one ad-hoc report can be examined and then drilled on, in order to obtain other related data elements in other ad-hoc reports. Thus, in one exemplary aspect of the disclosure, when a user selects a data element in an ad-hoc report, another ad-hoc report is generated containing data elements that are obtained as a result of taking into account 1) the original query associated with data element in the ad-hoc report; 2) the context of the selection in the ad-hoc report, and 3) the granularity of the resulting query associated with the resulting ad-hoc report.