Abstract: Document management techniques to account for user-specific patterns in document metadata are disclosed. In one embodiment, a method for facilitating document retrieval may comprise: assigning a first entitlement to a first user for accessing a first plurality of documents; identifying patterns in the first user's creation or modification of metadata related to the first plurality of documents; recording the identified patterns associated with the first user; receiving a document query from a second user who has been assigned a second entitlement to access a second plurality of documents; determining, based on the second entitlement, an access right of the second user with respect to the first plurality of documents; and modifying the document query based on the access right of the second user and the identified patterns, such that the document query returns relevant documents from the first plurality of documents despite the second user's ignorance of the identified patterns.

Abstract: Methods and systems for a topology service providing an interface for specifying a topology and answering queries regarding the topology. Further, the topology service may create, from a specified topology, a directed acyclic graph and corresponding closure table. The topology service may also provide an interface for receiving metadata regarding the topology. In this way, the topology service, based at least in part on connections between nodes in the entries of the closure table and based at least in part on the metadata regarding the topology, may answer queries in regard to the specified topology.

Abstract: An electronic media distribution/play system includes a service facility that has a communications network interface and maintains a data file catalog. The catalog is sent over the network to requesting users, and the system processes payments from customers in establishing file access authorizations. Encrypted user-selected files and a player program are transmitted to each customer for metered access to received data files as limited by the authorization, and customers can make additional selections and play the encrypted files freely while the authorization remains established. The system can transmit the data files from local storage, and also provide links to encrypted files that are stored at remote vendor facilities. Authorizations can be for selected portions or class levels of the catalog, and for terms measured as calendar time, play time, and collective number of plays. Also disclosed is a method for facilitating the distribution and accessing of electronic files.

Abstract: Systems and methods for identifying inadequate search content are provided. Inadequate search content, for example, can be identified based on statistics associated with the search queries related to the content.

Abstract: Systems and methods for demonstrating a replacement information management software for a computing system. The methods may include determining if existing information management software is installed in the computing system. The methods may include identifying computing devices of the computing system using information from the existing information management software. The methods may include simulating the replacement information management software with characteristics of the identified computing devices to enable a user to experience the replacement information management software prior to committing to installing the replacement information management software in the computing system. The methods may include automatically installing the replacement information management software. Other implementations are disclosed.

Abstract: Systems and methods are provided for transmitting data for secure storage. For each of two or more data sets, a plurality of shares are generated containing a distribution of data from an encrypted version of the data set. The shares are then stored in a shared memory device, wherein a data set may be reconstructed from a threshold number of the associated plurality of shares using an associated key. Also provided are systems and methods for providing access to secured data. A plurality of shares containing a distribution of data from an encrypted version of a data set are stored in a memory device. A client is provided with a virtual machine that indicates the plurality of shares, and the capability to reconstruct the data set from the plurality of shares using an associated key.

Abstract: A method and system for fuzzy full text search is disclosed. The system includes an inverted index where tokens are organized in a Next Valid Character (NVC) tree. Each path through the tree defines a token. The document sets for the tokens are stored at leaf nodes. After receiving search tokens, the system traverses the NVC tree in a lazy manner by exploring paths through nodes associated with the smallest edit distance. The system provides a result set per edit distance. For example, the system provides a result set of document identifiers associated with documents having the least amount of error first, followed by result sets of document identifiers associated with documents that have progressively more error.

Abstract: Systems, methods, and computer program product embodiments are provided for path-based query evaluation. The embodiments include representing a markup language document as a descriptive catalog, and capturing relationships in the descriptive catalog as an index summary. The index summary is utilized for evaluating a path-based query.

Abstract: A method and system for processing a query on a key-value store, including receiving a query, determining a data path in a cube based on dimensions of the received query, traversing the data path using a data path iterator from a root to blocks in the key-value store, allocating a query slice, determining rows and columns in the query slice using the data path, reading the blocks traversed by the data path iterator from a storage area, merging each of the blocks into a result cell of the query slice, and outputting the query slice.

Abstract: Disclosed are techniques employed alone or in combination, to further enhance a database language and improve conciseness and comprehensiveness of query statements in application code. Embodiments may build upon an initial extension of database language to accommodate concepts of entity-relationship models (ERMs). That initial extension may include entities with structured types, and named associations. One technique modifies SQL to allow the SELECT command to specify element path expressions based upon a relationship (e.g. named associations between ERM elements). Another technique modifies SQL to introduce filter expressions suffixed to associations within path expressions, thus improving adherence to the principle of locality within query statements. Yet another technique allows a shorthand to “factor out” association path prefixes, thereby avoiding lengthy lists of path expressions in order to read several elements from the same nested structure or a same target entity behind a single association.

Abstract: The present invention extends to methods, systems, and computer program products for formulating global statistics for parallel databases. In general, embodiments of the invention merge (combine) information in multiple compute node level histograms to create a global histogram for a table that is distributed across a number of compute nodes. Merging can include aligning histogram step boundaries across the compute node histograms. Merging can include aggregating histogram step-level information, such as, for example, equality rows and average range rows (or alternately equality rows, range rows, and distinct range rows), across the compute node histograms into a single global step. Merging can account for distinct values that do not appear at one or more compute nodes as well as distinct values that are counted at multiple compute nodes. A resulting global histogram can be coalesced to reduce the step count.

Abstract: A method, article of manufacture and apparatus for decomposing an initial query into smaller conditional groups for execution on a database is disclosed. A separate database query may be generated for each of the conditional groups, and the results of executing these separate database queries may be combined and returned as the result of the initial query. Typically, the initial query may be decomposed because it is otherwise too large and/or too complex to be executed directly.

Abstract: A computer-implemented method of semantically linking, by a computing device, a citing document to a cited document in a corpus of documents includes locating at least one citation present in the citing document, determining a reason-for-citing for at least one citation, and determining a cited-text-area present in the cited document, wherein the cited-text-area corresponds with the reason-for-citing. The method further includes populating a citation entry of a citation-pairing metadata file with a citing-document identifier, a reason-for-citing identifier, a cited-document identifier, and a cited-text-area identifier. The citation-pairing metadata file includes a plurality of citation entries and is stored separately from the citing document and the cited document.

Abstract: Disclosed herein are systems, methods, and computer-readable media for dynamically managing data-centric searches. The method includes identifying an event related to domain-specific searches to a database, identifying data at a first memory location in the database, duplicating the data to a new memory location, and distributing processing more domain-specific searches amongst an expanded search space including the new memory location and the first memory location. The expanded search space can be reduced or collapsed in response to a reduction event by removing duplicate data from the first memory location or the new memory location and adjusting the distribution of processing amongst the remaining memory location. The method can optionally include organizing multiple events by network segment, identifying a network segment associated with domain-specific searches, and duplicating the data to a new memory location in close proximity to the identified network segment.

Abstract: The present description refers to a computer implemented method, computer program product, and computer system to store a node dependency network that includes a plurality of data nodes and one or more links between two or more data nodes, each link representing a data dependency between instances of the two or more data nodes, to forward a requested change to a first data node from a first change control component to a change control manager, identify, by the change control manager based upon the links within the node dependency network, one or more dependent data nodes that are dependent upon the first data node, and determine one or more dependent changes to be performed to one or more instances of the dependent data nodes to maintain consistency among instances of the data nodes.

Abstract: A voice channel connection and a data channel connection are established with a structured voice interaction system. Navigation information for and provided by the structured voice interaction system is received over the data channel connection. The data channel navigation information is coordinated with navigation information provided by the structured voice interaction system over the voice channel connection.

Abstract: Techniques for external application-directed data partitioning in data exported from a parallel database management system (DBMS) are provided. An external application sends a query, a total number of requested access module processors (AMPs), and an application-defined data partitioning expression to the DBMS. The DBMS executes the query with the results vertical partitioned on the identified number of AMPs. Individual external mappers access their assigned AMPs asking for specific partitions that they are assigned to process the query results.

Abstract: Methods for identifying symbolic links in network file systems are provided herein. An absolute path may be determined at a network file server. This may include determining a complete client path from an initial client path and combining the complete client path with a server export path. Once the absolute path is determined, it may be traversed using a file descriptor of each file in the absolute path to identify a symbolic link.

Abstract: A method for storing intermediate result sets in a database is provided. An access plan for a single query for accessing data stored in the database system is received. An intermediate result set is generated during execution of the access plan. A value of an intermediate result set rating of the intermediate result set is determined during execution of the access plan at runtime of the query for determining if the intermediate result set, generated during the execution of the access plan, is to be stored. Based on determining that the value of the intermediate result set rating meets a predefined criterion, the determined intermediate result set is stored for a longer period of time than the runtime of the query as a stored intermediate result set.

Abstract: A grouping apparatus manages user information, and executes grouping processing for extracting a subset which matches a predetermined condition from a set of users. A flow control apparatus transmits a set of users to one of a plurality of grouping apparatuses, and transmits a condition used in grouping processing to each of the plurality of grouping apparatuses. One of the grouping apparatuses transmits, to another grouping apparatus, a first subset which is extracted by executing grouping processing on the set transmitted from the flow control apparatus. The other grouping apparatus extracts a second subset by executing grouping processing on the first subset transmitted from the one of the grouping apparatuses.

Abstract: A method and apparatus for a data warehouse built on top of MapReduce is provided. A virtual view is defined on top of the common star or snowflake data warehouse schema. A SQL-like, but much more succinct, query language is provided to leverage the virtual view. Many advanced query processing features leveraging the virtual view are also provided. Further, several optimization techniques ranging from data compression and access method to multi-query optimization and exploiting materialized views are provided. Further, a technique to seamlessly integrate the data warehouse system into any ad-hoc MapReduce jobs is provided. Thus, fully leveraging the power of both MapReduce and data warehouse technologies is achieved.

Abstract: Systems and processes for data presentation may be implemented with a variety of operations and techniques. In particular aspects, a system and process for data presentation may include the ability to receive a data request at a data distribution device and determine data responsive to the data request, the responsive data including textual data. The system and process may also include the ability to modify the textual responsive data based on a user interface for visually presenting the textual responsive data and generate a data response including the modified textual responsive data.

Abstract: The subject mater herein relates to database management and, more particularly, to non-equijoin metadata. Various embodiments described herein provide systems, methods, software, and data structures to facilitate non-equijoins of data. Some such embodiments include a data store to hold metadata describing relationships between database tables. The relationships between database tables may include one or more non-equijoins of tables in the form of one or more table-column pairs of a first table being non-equal to one or more table-column pairs of a second table. In some embodiments, the metadata may be used by a query generator to build query statements including one or more non-equijoin.

Abstract: A method, system and computer-usable medium are disclosed for maintaining persistent links to information stored on a network. Information elements are tagged and their original network location is saved as a hyperlink. The tagged information elements are then acquired at the original network location by a search engine crawler, indexed by a search engine, and stored in an information location index. The tagged information elements are periodically submitted to the search engine to generate search results. Comparison operations are performed to determine the search results comprising the closest-matching information elements and their current network location. The network location stored in the hyperlink is replaced with the current network location if it is not the same.

Abstract: A data existence judging device includes: L number of first storage areas each associated with one of L hash values; M number of second storage areas each associated with some of the L hash values; an information setting part, for each data in a data set, to calculate k hash values about the data, and, for each calculated hash value, when a count value in the first storage area associated with the calculated hash value is less than 2n?1, to count up the count value, whereas when the count value is 2n?1, to set 1 into the first storage area associated with the calculated hash value; and a judging part to calculate k hash values about an input data, and to judge that the input data is a new data when a count value in the first storage area associated with the input data is 0.

Abstract: A variety of query optimization techniques are described herein. A first query optimization technique, referred to herein as non-empty transformation, may be applied to queries that specify one or more measures, a dimensional context within which the measure(s) are to be evaluated, and a filter condition specifying that rows with only empty measure values be excluded from a result set. The non-empty transformation technique enables such queries to be rewritten into another format that can be executed more efficiently than the original queries. A second query optimization technique described herein involves restructuring an operator tree representation of a query so as to avoid unnecessary duplicated evaluation of extension columns. A third query optimization technique described herein automatically selects a minimum number of join columns having the lowest cardinality for implementing a join between two tables.

Abstract: Embodiments of the present invention are directed to a method for information management. In one embodiment, the method includes providing an organizational directory comprising hierarchical information regarding an organization and receiving relationship data including an association of a first person to a second person. The method also includes querying the organizational directory and the relationship data to identify a third person, wherein the third person is a member of the organization and identifying the third person comprises determining a path including the third person in an association network.

Abstract: Longest Prefix Match (LPM) is implemented using a binary tree based search algorithm. Masked entries are stored in a plurality of binary search engines, wherein each of the binary search engines stores masked entries of a corresponding mask length. A search value is applied to each of the binary search engines in parallel. The search value is masked within each of the binary search engines, thereby creating a plurality of masked search values, each having a masked length equal to the mask length of the corresponding binary search engine. Each of the masked search values is compared with the masked entries of the corresponding binary search engine. An LPM result is selected from the binary search engine that detects a match, and has the longest corresponding mask length. Alternately, each binary search engine stores masked entries of N mask lengths, and N consecutive comparisons are performed to identify the LPM.

Abstract: Techniques for optimizing outer joins in database operations are provided. In an embodiment, a query having an outer join with a GROUP BY clause is rewritten and expanded to expand a first level partition of that GROUP BY clause to produce a modified query. In another situation, rows associated with processing a query are each row split and then hashed based at least in part on attributes of the outer join predicate. A left outer join is performed and a global aggregation processed to produce a spooled table to process the query.

Abstract: An approach is provided to modifying structured query language (SQL) statements to more efficient forms. In the approach, an SQL statement is received and compared to a number of predefined malformation rules with at least one of the predefined malformation rules includes a syntactical pattern. If the comparison reveals that the received SQL statement includes a malformed expression that would be inefficiently processed by a database engine, the malformed expression is modified to an efficient SQL expression form and the efficient SQL expression form is executed by the database engine.

Abstract: The present invention discloses devices including a transparent client-connection manager for exchanging client data between application servers and the device: a request analyzer for analyzing query requests from at least one application server; a data-retrieval/command-execution module for executing query requests; a database connection manager for exchanging database data between at least one database server and the device; a cache-memory pool for storing data items from at least one database server; a cache-policy module for determining cache criteria for storing the data items In the cache-memory pool; and a data-consistency invalidation module for determining invalidated data items based on invalidation criteria for removing from the cache-memory pool. The cache-memory pool is configured to utilize memory modules residing in data proxy devices and distributed cache management utility, enabling the memory capacity to be used as a cluster to balance workloads.

Abstract: Resolving a query received from a first node in a network includes accepting, by a second node in the network, ownership of the query from the first node, receiving, at the second node, an identification of a third node in the network, wherein the identification is received from a user of the second node and the user of the second node believes that a user of the third node has information necessary to resolve at least part of the query, and transferring, by the second node, ownership of the at least part of the query to the third node, wherein the accepting, the receiving, and the transferring dynamically generates a data structure that traces a propagation of the query, and the data structure is accessible to an origin of the query.

Abstract: A method and system for providing keyword ranking using a common affix is provided. The method for providing keyword ranking using the common affix includes: extracting a common affix using a keyword set; and providing keyword ranking which includes the extracted common affix.

Abstract: Resolving an issue raised by at least one user includes establishing a contact session over a communication channel for servicing the issue. The Internet is searched for content related to providing a resolution for the issue using a customized query, when a search of a database does not return results. Content obtained from at least one Internet source as a result of searching the Internet using the customized query is restructured to prepare the resolution for the issue. The at least one Internet source from which the content was obtained is updated with the resolution.

Abstract: Methods and arrangements for storing and retrieving nested structures. A nested structure is obtained. There are created slices containing arbitrary sub-structures of the nested structure. The content of slices is stored in one or more columns of a column-oriented data store. At least one access plan for accessing slices in the data store is developed, to be used when a projection query is received. The access plan is executed to construct a nested structure that answers the projection query. Other variants and embodiments are broadly contemplated herein.

Abstract: An electronic media distribution/play system includes a service facility that has a communications network interface and maintains a data file catalog. The catalog is sent over the network to requesting users, and the system processes payments from customers in establishing file access authorizations. Encrypted user-selected files and a player program are transmitted to each customer for metered access to received data files as limited by the authorization, and customers can make additional selections and play the encrypted files freely while the authorization remains established. The system can transmit the data files from local storage, and also provide links to encrypted files that are stored at remote vendor facilities. Authorizations can be for selected portions or class levels of the catalog, and for terms measured as calendar time, play time, and collective number of plays. Also disclosed is a method for facilitating the distribution and accessing of electronic files.

Abstract: Disclosed are methods and systems for function module dispatcher. The methods and systems involve generating a multi tenant enabled function module by adding a logical tenant access parameter to a function to be executed in a tenant system. The methods and systems further include receiving access data associated with a central tenant system and input parameters for executing the function module on one or more tenant systems, accessing a central tenant system based on the access data, retrieving tenant access data associated with the tenant system by matching a logical tenant access parameter data received in the input parameters to the multi tenant function call with the tenant access parameter data stored in a destination map and dispatching the call to execute the function module on a respective tenant based on the tenant access data retrieved from the destination map.

Abstract: A search server system having one or more processors and memory receives a search query including filter criteria. The filter criteria specify operands and a logical relationship. In response to the search query the server identifies index portions sorted in a same sort order. The server identifies matching entities that match the search query by identifying index entries having a first identifier and matching filter(s) of a first operand and identifying, index entries having a second identifier that is sequentially adjacent to the first identifier in the sort order and matching filter(s) of a second operand. When index portion(s) associated with the first operand include index entries having a respective identifier between the first identifier and the second identifier and matching the filter(s) of the first operand, the server marks a respective entity associated with the respective identifier as matching the search query and sends search results to the client.

Abstract: The method and system of the present invention provides an improved technique for replacing, implementing and managing computer-related assets. A technician accesses the World Wide Web through a user's computer. The information resident on the computer, including information regarding the computer and the user's preferences, are downloaded to a remote storage medium through the World Wide Web. Once downloaded, all information may be removed from the user's computer. Subsequently, the technician accesses another computer such as, for example, a new computer that has been assigned to the same user. The technician accesses the World Wide Web through the new computer and downloads the information previously stored on the remote storage medium. This information can then be used to install the user's prior applications, settings and preferences on the new computer.

Abstract: A technique for factoring uncertainty into cost-based query optimization includes: determining the degree of uncertainty involved in the cost estimates for the query, determining the degree of sensitivity the query has to that uncertainty, and determining if there is an access path that performs well across the range of possible conditions that could occur at execution time, reducing the risk of performance spikes and performance volatility. If such an access path exists, select that access path; if not, perform parametric query optimization or query re-optimization.

Abstract: A mobile computing device adapted to request to receive a plurality of objects comprising a website in a new order, the new order being different than an original order, wherein, at least a portion of the original order comprises an order provided from a base level website object. The new order for requesting to receive the plurality of objects is based on at least one of a plurality of metrics. The metrics comprise a depth of each of the plurality of objects, one or more children of the plurality of objects, an object type for each of the plurality of objects, whether a connection has been established with a domain servicing each of the plurality of objects, and when the connection was last established to the domain servicing each of the plurality of objects.

Abstract: A document search system includes a plurality of computers in a network having a router, and an email software program on each of the computers. A database stores attachment files and email documents. A search program on at least one of the computers initiating storage of email documents and attachment files. A mail journal database stores email data extracted by the search program from the email. A message identification (ID) identifying the email document, and the ID being generated by the search program and associating an email document with corresponding email data, and the ID associating the email document with an attachment file when an attachment file is sent. A file loader replacing an attachment file with a file link and storing the attachment file in the database. The file link provides access to the attachment file in the database.

Abstract: Method and apparatus for stress management in a searchable data service. The searchable data service may provide a searchable index to a backend data store, and an interface to build and query the searchable index, that enables client applications to search for and retrieve locators for stored entities in the backend data store. Embodiments of the searchable data service may implement a distributed stress management mechanism that may provide functionality including, but not limited to, the automated monitoring of critical resources, analysis of resource usage, and decisions on and performance of actions to keep resource usage within comfort zones. In one embodiment, in response to usage of a particular resource being detected as out of the comfort zone on a node, an action may be performed to transfer at least part of the resource usage for the local resource to another node that provides a similar resource.

Abstract: Detection of skew in an on-demand database services environment is provided. A request is generated to scan a multitenant database for skew indicated by relationship depth exceeding an expected limit. A database crawler calculates skew for tenant identifier for a particular table in the database. Any skew that is detected is identified for later resolution.

Abstract: Exemplary embodiments are directed to a combination of real time processing functions and batch time processing functions to process stream data. When a query is received with a target function, the target function is processed based on the utilization of both a real-time processing function and a batch time processing function. The real time processing functions may be executed by a sliding window, and the batch processing function may be executed by a jumping window.

Abstract: A search server system having one or more processors and memory receives a search query including filter criteria and sort criteria from a client. The filter criteria specify a plurality of operands and a logical relationship. The sort criteria specify a predefined sort order. In response to the search query the server identifies a plurality of index portions sorted in the predefined sort order. The server identifies one or more matching entities by comparing identifiers for index entries matching filter(s) of a first operand with identifiers for index entries matching filter(s) of a second operand and sequentially retrieving the identifiers for the matching index entries corresponding to matching entities from the plurality of index portions in the predefined sort order. The server then transmits search results including representations of matching entities to the client.

Abstract: The approaches described herein provide an efficient way to process certain kinds of queries that retrieve XML data stored in an object-relational database. An XML query may include a predicate condition that joins two row sources. One or both of the row sources required for predicate evaluation may be path-based; that is, consume and produce rows of XMLType data. Such a path-based row source may be modified to use the predicate condition to filter the rows it generates so that only rows satisfying the predicate condition need to be further processed. A small cache structure introduced into the path-based row source may be used to optimize the evaluation of the predicate row. Once populated with row data, the cache structure may be reorganized to optimize the performance of predicate evaluation.

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: A database access model and storage structure that efficiently support concurrent OLTP and OLAP activity independently of the data model or schema used, are described. The storage structure and access model presented avoid the need to design schemas for particular workloads or query patterns and avoid the need to design or implement indexing to support specific queries. Indeed, the access model presented is independent of the database model used and can equally support relational, object and hierarchical models amongst others.

Abstract: Exemplary systems and methods for server management are provided. An exemplary system comprises a plurality of servers, with each server having the ability to access a database or, in some embodiments, be configured to perform a calculation, computation or make a determination of a particular value, values or other information. A communications network delivers queries to each server whereby a look-up table directs query processing by the servers. Further embodiments of the system feature a program logic controller for rebalancing the workload of the network servers. Exemplary methods of processing queries on the system comprise submitting a query to the network, communicating the query to each server in the network and each server looking-up on a look-up table the processing responsibilities of the servers in the network. The query is processed by the server having primary responsibility for processing the query while other the servers monitor query processing.