Abstract: Custodians of ESI are ranked depending upon the involvement of the custodians with the ESI. The term weights of terms are enhanced based upon the custodian ranking. More particularly, terms appearing in items of the ESI having a high calculated weight, i.e., for which important custodians were involved, are given more term weight than terms appearing in items having a low calculated weight, i.e., for which less important custodians were involved. This optimizes the e-discovery by allowing an early decision to be made of whether to settle the matter or to continue with the review process.

Abstract: An information processing apparatus and method composites and displays a map image at a designated scale and an object associated with the map image at the designated scale. The apparatus and method count the number of times of designation with respect to a position on a map, and manage the number of times of designation in association with the position and the map. If the number of times of designation with respect to a position of interest on the map exceeds a threshold value, a position that is managed in association with a large-area map including an area shown by the map is specified, and an object in the specified position on the large-area map is highlighted on the large-area map.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for displaying one or more data sets to a user. These mechanisms and methods for displaying one or more data sets to a user can enable enhanced data security, more relevant data display, reduced processing, etc.

Abstract: In various embodiments, methods and systems for dynamic validation of selectable data are provided. This may be accomplished by referencing search engine session data of a user. The search engine session data includes a plurality of search queries each having an entered-attribute and a resolved-attribute. A variation between the entered-attribute and the resolved-attribute, for each of the plurality of search queries, is determined based on analyzing the entered-attribute and the resolved-attribute. The entered-attribute is an input of the user and the resolved-attribute is a resolved-input for executing the search query. An input-precision score is generated for the user based on the variation between the entered-attribute and the resolved-attribute, for each of the plurality of search queries.

Abstract: A reallocation processing block including a computing system including one or more data processors receives a base table, a reference table, and at least one assignment path table. Subsequently, rules from the at least one assignment path table are applied to the base table and the reference table by reallocating values between at least two existing data objects. A results table is generated with the reallocated values in the at least two existing data objects. A reallocated value is compared with a threshold value to determine the need for an iteration. At least one of the activities described is implemented using at least one data processor. Related apparatus, systems, techniques and articles are also described.

Abstract: Dynamic sourcing, in which a data request that is associated with a query is received and a parameter of data needed for satisfaction of the query is identified. Parameter information defining data available in at least one cube stored in a cache is accessed and the parameter is compared with the parameter information. Based on comparison results, it is determined whether one or more cubes in the cache include sufficient data to satisfy the query. In response to a determination that one or more cubes include sufficient data to satisfy the query, a response to the data request is generated by executing the query against the one or more cubes. In response to a determination that the cubes do not include sufficient data to satisfy the query, a response to the data request is generated by executing at least a portion of the query against a database system.

Abstract: In an optimizer within a Relational Database Management System improved ways in which a search space (the universe of possible join combinations) is generated and managed and improved ways in which the elements of a search space are evaluated so that among other things unpromising elements are efficiently dropped (pruned).

Abstract: Systems, methods, and computer-readable storage media for providing a rich search experience utilizing entity-type characterization are provided. A search query is received and an entity type is determined for the query. A Web search is then performed for the query against a predefined list of sources determined to be authoritative for the determined entity type. The results of the source-specific searches are filtered based upon the entity type providing a filtered list of results that each pertains to an entity of the entity type determined to be associated with the query. The filtered list are then compared to a list of resolved entities to determine equivalent entities identified by different searched sources, the equivalent entities being combined into a single potential search result. The consolidated search results are then ordered based upon rank values. At least a portion of the results may then be presented to the user.

Abstract: SQL queries are optimized to operate directly on compressed data (and obtain the correct result) rather than requiring that the data be first decompressed prior to processing a query. Certain characteristic pattern trees are mapped against a logical input query plan that includes certain logical operators such as a DECOMPRESS that precedes a JOIN or a GROUPBY in association with a COUNT to identify instances in the plan that match a characteristic pattern. Upon locating a match, the input query plan is transformed into a logically equivalent plan that operates correctly on compressed data, by analyzing the interplay of the semantics of logical query operations with the compressed data and substituting less costly structures and operations. DECOMPRESS operations are moved to operate subsequent to a JOIN or eliminated altogether, and COUNT operations are replaced by a different operation, such as SUM, that is logically equivalent for compressed data.

Abstract: In one aspect, data, such as information articles, is sorted and prioritized based on a plurality of factors, such as user interest and popularity of data with respect to other users. The data is sorted by initial personal (i.e., user) data, sorted by the most relevant to the user, while passive interaction data is used to continually reorder the articles in real-time, while new stories are being injected into the stream in real time, all while other articles are increasing/decreasing in stature based on popularity with regard to other users and time decay. As such, the system provides that the information is fed to users in an efficient manner, in a manner based on time relevance, assumed interest with regard to that given user based on past actions by that user or information otherwise known about that user, as well as interest in the articles demonstrated by other users.

Abstract: A pattern can be identified in at least part of a query whose definition is received in a query request. The identified pattern can be matched with a set of pre-defined patterns, each of which has associated therewith at least one pre-compiled query execution sub-component of a plurality of pre-compiled query execution sub-components retained in a library. A plan for executing the query can be generated, for example by incorporating the pre-compiled query execution sub-component associated with the matched pattern into the plan based on a pseudo code representation of the plan derived from the definition.

Abstract: Mechanisms are provided that: identify topics associated with a plurality of pieces of media content presented in a session; calculate a distance metric for pairs of topics, wherein each of the pairs of topics includes a first topic associated with a first piece of media content and a second topic associated with a second piece of media content, and wherein the second piece of media content was presented within a given span of the presentation of the first piece of media content; for each first topic of the pairs of topics, generate a rank-ordered list for all corresponding second topics; for each of the plurality of pieces of media content, generate a single rank-ordered list of all second topics; and for each of the plurality of pieces of media content, identify one or more other pieces of media content as recommended media content based on the single rank-ordered list.

Abstract: A multi-function search box on a word page is provided to enable a user to enter a word. The multi-function search box includes a text input control to provide text input functionality. The text input control is capable of suggesting a complete word based on a partially entered word. A dropdown display area is provided in the multi-function search box to display a list of words, every word therein contextually related to the fully entered or partially entered word. Another dropdown display area is provided to display contextually related options for a selected word in the list of contextually related words.

Abstract: A computer-implemented method, carried out by one or more processors, for managing replication configurations. In an embodiment, the method comprises receiving, by one or more processors, a replication configuration for replicating data, wherein the replication configuration defines at least a target table in a target database based on a source table in a source database; initializing, by one or more processors, a federated view, wherein the federated view is based on at least the source table in the source database as defined in the replication configuration; utilizing, by one or more processors, the federated view to satisfy requesting applications, where requesting applications obtain data from the federated view; responsive to determining the replication of data is in spec, utilizing, by one or more processors, the target table in the target database to satisfy requesting applications.

Abstract: A procedural pattern in a received query execution plan can be matched to a stored pattern for which an equivalent declarative operator has been pre-defined. The query execution plan can describe a query for accessing data. A hybrid execution plan can be generated by replacing the procedural pattern with the equivalent declarative operator. A hybrid execution plan processing cost can be assigned to execution of the hybrid execution plan and a query execution plan processing cost can be assigned to execution of the query execution plan. The assigning can include evaluating a cost model for the hybrid execution plan and the query execution plan. The query can be executed using the hybrid execution plan if the hybrid execution plan processing cost is less than the query execution plan processing cost or the query execution plan if the hybrid execution plan processing cost is greater than the query execution plan processing cost. Related systems, methods, and articles of manufacture are disclosed.

Abstract: A system and method of providing contextual breadcrumbs is disclosed. A current page may be caused to be displayed on a device. Contextual breadcrumbs may be caused to be displayed on the current page. The contextual breadcrumbs may comprise a simplified representation of a first different page. The first different page may be different from the current page. The simplified representation of the first different page may comprise context information regarding a function of the first different page. The context information regarding a function of the first different page may comprise a visual representation of functional options of the first different page. At least one of the contextual breadcrumbs may be configured to enable the user to act upon the functional options of the first different page from the current page.

Abstract: In one aspect, data, such as information articles, is sorted and prioritized based on a plurality of factors, such as user interest and popularity of data with respect to other users. The data is sorted by initial personal (i.e., user) data, sorted by the most relevant to the user, while passive interaction data is used to continually reorder the articles in real-time, while new stories are being injected into the stream in real time, all while other articles are increasing/decreasing in stature based on popularity with regard to other users and time decay. As such, the system provides that the information is fed to users in an efficient manner, in a manner based on time relevance, assumed interest with regard to that given user based on past actions by that user or information otherwise known about that user, as well as interest in the articles demonstrated by other users.

Abstract: A streams manager monitors performance of a streaming application, and when the performance needs to be improved, the streams manager requests a cloud manager provision one or more VMs on a server that has a specified hardware type, and optionally has specified available hardware capacity. In response, the cloud manager determines which available servers have the specified hardware type, and when available hardware capacity is specified, further determines which of the available servers with the specified hardware type have the specified available capacity. When there are multiple servers that satisfy the request from the streams manager, the cloud manager determines from historical performance logs for the servers which is preferred. The cloud manager then provisions the requested VM(s) on the specified hardware type and returns the requested VM(s) to the streams manager. The streams manager then deploys a portion of the streaming application to the VM(s).

Abstract: Methods, systems, and apparatus include computer programs encoded on a computer-readable storage medium, including a method for updating graphs. Labels associated with nodes of a graph are identified, including designators describing an attribute associated with a given node. The graph is provided, wherein labels have been assigned to each node in the graph. An initial set of weights for the labels are assigned reflecting a magnitude of a contribution of an associated label to a characterization of a respective node. A portion of the labels are assigned based on a propagation from other nodes. A change is identified in the graph that, when propagated, will affect other nodes. Sparse matrices, generated to describe the change, contain nonzero entries only in rows wherein connection weights and/or labels have changed. A new graph is generated using the sparse matrices without having to recalculate weights for other nodes not affected by the change.

Abstract: An input method editor (IME) described herein couples scenarios of the input of the user with specific network services to offer more relevant and richer candidates for higher input productivity. Data relating to a computer application in which the input candidates are to be input and/or context relating to a user-submitted query is collected and analyzed to determine a scenario. The input candidates may include text candidates and rich candidates. The IME may select a scenario-tuned and type specific engine to identify the text candidates and/or rich candidates. The scenario-tuned text candidate engines leverage scenario-tuned language models and lexicons, and the scenario-tuned rich candidate engines leverage scenario-relevant web services, such as image, mapping, and video search, when available and appropriate.

Abstract: A method for filtering social media content based on interest categories. Users of a social network can be associated with one or more interest categories. Posts or updates made in the social network by friends of a first user are associated with one or more interest categories. A social feed can be filtered based on the interested categories or the first user of the social feed and/or the interests associated with the posts or updates made by the first user's friends. In some cases, the filtered social media content is ordered based on expertise of the first user's friends in the particular interest categories of those users' posts.

Abstract: In one embodiment, a method includes receiving a request for data visualization. The request specifies input data, at least one user query, and a data-visualization type. The method further includes inferring at least one additional query based on a user-interface (UI) range of freedom associated with the request. In addition, the method includes causing a map-reduce framework to process the input data according to the at least one user query and the at least one additional query. The causing yields resultant data. Further, the method includes storing in a cache a portion of the resultant data that relates to the at least one additional query. The method also includes generating the requested data visualization based on a portion of the resultant data that relates to the at least one user query.

Abstract: Devices, methods and systems for processing database queries formatted differently than the database storage model being queried are disclosed. Processing database queries independent of the storage model of the queried database may be performed by receiving a query for one or more data items stored in a database, determining whether to use at least one query operator that uses data having a format different from the storage model format of at least one of one or more data items stored in the database and converting the format of the data used by the at least one query operator to a format that matches the storage model format of at least one of one or more data items stored in the database. Related systems, methods, and articles of manufacture are also described.

Abstract: Technology described herein identifies and demotes query completions which divert users from their original search intent. The identified query completions may represent informational requests that are amusing diversions for some users, but which are not relevant to the actual information of interest for many users. For example, the identified query completions may represent information requests that some users may find humorous or entertaining, but which are not relevant to actual information of interest for many other users. The identification of these query completions may allow alternative query completions to be provided that can more likely assist users in finding the information they actually seek.

Abstract: A search result is modified to include a predetermined number of channels within a predetermined number of a plurality of entries in the search result. The search result is generated in response to a search query. The search result is modified to comprise a predetermined number of channels within a predetermined number of the plurality of entries. The modified search result is updated based on the plurality of entries and a subset of the updated modified search result is selected to be presented in response to the search query. The subset of the updated modified search result comprises the channel and at least one selection of data content.

Abstract: A data processing method comprising using an application server computer, establishing a shared multi-tenant system in which tenant data that is associated with tenants is stored together in a real shared data store system; providing to a tenant computing device identifiers that identify virtual objects, wherein each of the virtual objects represents a data entity that is stored in the real shared data store system; receiving a SQL query from the tenant computing device that specifies a data operation on a first virtual object of the virtual objects; rewriting the SQL query by dynamically replacing the first virtual object with an identifier of a function; executing the function and the rewritten query without explicit metadata to generate a result set; sending the result set to the tenant computing device.

Abstract: A similarity calculating method and apparatus are disclosed. A similarity calculating method according to an exemplary embodiment of the present invention includes extracting similarity calculating data, which is determined in advance, by receiving a communication activity record for every user; modeling a communication activity pattern for every user and common information between the users based on the extracted similarity calculating data; and calculating a similarity between users using the modeled communication activity pattern for every user and common information. The modeling includes: modeling the communication activity pattern by calculating a value of a static feature from the similarity calculating data, and modeling the common information by calculating a value of a dynamic feature from the similarity calculating data.

Abstract: Systems and methods for approximating a user location are provided. For instance, historical location data and internet protocol address data can be analyzed to identify a plurality of locations. A confidence score for each of the plurality of locations can be determined. Two or more locations of the plurality of locations that form a cluster can be identified and the confidence scores for each of the two or more locations that form a cluster can be modified by adjusting each confidence score by a weight associated with the cluster.

Abstract: The present invention is directed towards systems and methods for efficient Xpath matching of a document comprising Extensible Markup Language (XML) or JavaScript Object Notation (JSON). A Xpath engine identifies an Xpath expression for processing values in the document, which is represented by a stack of nodes. The device may traverse the stack from top to bottom to match each step of the Xpath expression to a type and name of one or more nodes in the stack. The device may store a flag in each node that matches a step of the Xpath expression. Responsive to encountering a leaf node, the device may trace bottom to top from the leaf node to one or more flagged nodes in the stack and compare each flagged node against a corresponding step of the path expression. Responsive to the tracing of the flagged nodes, the device determines if the path expression is matched.

Abstract: Techniques for managing tactical query to continuous query conversion are provided. In some examples, a tactical query configured to enable the pulling of business event data from a database to a query engine may be determined. For example, a query engine may be configured with the tactical query. The configuration may be based at least in part on an indication of the business event data to be displayed. Further, in some examples, a conversion of the tactical query to a continuous query may be enabled. The conversion or enablement of the conversion may be based at least in part on a request.

Abstract: A computer implemented method, system, and/or computer program product performs an appropriate type of data analysis for a user. A preliminary request for a data analysis is received from a user having a user profile. The preliminary request fails to identify an appropriate data source for the data analysis, and fails to identify an appropriate type of data analysis. Thus, a customized request, that identifies the appropriate data source for analysis, is created from the preliminary request based on the user's profile. The customized request is mapped, based on the user's profile, to a specific data constrained analytic algorithm that performs the appropriate type of data analysis. This specific data constrained analytic algorithm performs the appropriate type of data analysis on the appropriate data source in order to generate an analytic result, which is transmitted to the user.

Abstract: There is provided systems and method for interactive voice response interface for webpage navigation. An existing webpage may be altered so that the webpage and corresponding forms offer Interactive Voice Response (IVR) to a user. A JavaScript library of other software component corresponding to the IVR interface may be downloaded to the user's system and/or browser when the user accesses the webpage. The webpage includes HTML tags corresponding to elements or a separate file/database may include links to the elements. The HTML tags and/or file/database correspond to an IVR flow of information. The JavaScript library is built to interpret the HTML tags and/or file/database so the IVR flow of information may be presented to the user. Thus, when a user engages the interactive mode, the JavaScript library may present the IVR flow to the user, interpret input from the user, and send the input to the underlying webpage.

Abstract: Apparatus and methods for premises gateway functions that integrate or unify functions typically distributed across multiple devices within a content-based network. In one embodiment, the out-of-band (OOB) signaling functionality normally provided in each of a set-top-box (STB) and digital video recorder (DVR) are unified into a common OOB (e.g., DOCSIS) capable premises gateway device, thereby obviating OOB tuners and related components from each device. In another variant, the premises gateway is adapted for all-IP operation, such as for use with IP-based computers and IP set-top boxes, etc. Fully unified variants are also disclosed, wherein the DVR and/or STB functions are physically integrated within the premises gateway.

Abstract: In embodiments, methods and systems for improving a query in a database system are provided. These method and system embodiments can enable greater contextual knowledge about the types and use of data in tables underlying a relational database to be employed to improve query efficiency. By employing contextual information, embodiments can provide improved queries and/or make recommendations to a query optimizer of a database system to improve its operation based upon knowledge of the data and/or application gathered. Embodiments can be useful in improving query performance in multi-tenant database systems.

Abstract: According to some aspects, a system is provided comprising at least one computer readable storage medium storing a cache of flight information comprising a plurality of flight solutions, the cache capable of being accessed to obtain flight solutions that meet a criteria specified in one or more flight search queries, and at least one computer programmed to apply at least one machine learning model to at least some of the flight information in the flight information cache to classify at least one of the plurality of flight solutions according to an assessed fidelity of the at least one flight solution, and perform at least one action based on the classified at least one flight solution.

Abstract: Systems and methods are disclosed for building and using decision trees, preferably in a scalable and distributed manner. Our system can be used to create and use classification trees, regression trees, or a combination of regression trees called a gradient boosted regression tree (GBRT). Our system leverages approximate histograms in new ways to process large datasets, or data streams, while limiting inter-process communication bandwidth requirements. Further, in some embodiments, a scalable network of computers or processors is utilized for fast computation of decision trees. Preferably, the network comprises a tree structure of processors, comprising a master node and a plurality of worker nodes or “workers,” again arranged to limit necessary communications.

Abstract: Example methods, apparatuses, or articles of manufacture are disclosed that may be implemented using one or more computing devices to facilitate or otherwise support one or more processes or operations associated with ranking entity facets using user-click feedback.

Abstract: Query optimizer accuracy is tested by measuring the actual execution times on a database of each of a plurality of alternative query plans for each of a plurality of queries, first ranking the plans by the actual execution times, then ranking the plans by estimated execution times, and correlating the two rankings by computing a rank correlation metric. The rank correlation metric is normalized so that different optimizers can be objectively compared.

Abstract: Systems and methods are disclosed for using machine learning (e.g., neural networks and/or combinatorial learning) to solve the non-linear problem of predicting the provisioning of a server farm (e.g., cloud resources). The machine learning may be performed using commercially available products, such as the SNNS product from The University of Stuttgard of Germany. The system, which includes a neural network for machine learning, is provided with an identification of inputs and outputs to track, and the system provides correlations between those. Rather than static rules, the machine learning provides dynamic provisioning recommendations with corresponding confidence scores. Based on the data collected/measured by the neural network, the provisioning recommendations will change as well as the confidence scores.

Abstract: Searching information includes: receiving current query data from a client; extracting generic attribute features of the current query data, wherein the generic attribute features are used for calculating a plurality of confidence degrees of the current query data that correspond to a plurality of categories, each of the confidence degrees indicating a degree of confidence that the current query data belongs to a respective one of the plurality of categories; determining the plurality of confidence degrees of the current query data based at least in part on the generic attribute features; selecting a category based at least in part on the plurality of confidence degrees, the selected category being one of the plurality of categories and having a confidence degree higher than a confidence degree of another category; searching in the selected category for a search result that corresponds to the current query data; and returning the search result.

Abstract: In various embodiments, methods and systems for dynamic validation of selectable data are provided. This may be accomplished by referencing search engine session data of a user. The search engine session data includes a plurality of search queries each having an entered-attribute and a resolved-attribute. A variation between the entered-attribute and the resolved-attribute, for each of the plurality of search queries, is determined based on analyzing the entered-attribute and the resolved-attribute. The entered-attribute is an input of the user and the resolved-attribute is a resolved-input for executing the search query. An input-precision score is generated for the user based on the variation between the entered-attribute and the resolved-attribute, for each of the plurality of search queries.

Abstract: A query is received by a database server from a remote application server. The query is associated with a calculation scenario that defines a data flow model that includes one or more calculation nodes and that includes a pre-defined aggregation property. Each calculation node defines one or more operations to execute on the database server. The database server can include a column-oriented database. Thereafter, the database server instantiates the calculation scenario such that, based on the aggregation property, at least one non-aggregating operation specified by a calculation node is transformed into a aggregating operation based on a root node aggregation of the calculation scenario. Subsequently, the database server executes the operations defined by the calculation nodes of the optimized calculation scenario to result in a responsive data set. The database server then provides the data set to the application server.

Abstract: A system design support apparatus identifies design information elements each achieving a corresponding one of multiple requirements concerning a system to be newly designed, by using a first table. When multiple design information elements are identified with respect to a certain one of the requirements as a result of the identification, the system design support apparatus identifies a design information element that establishes a combination at a higher aptitude rank among the multiple design information elements, while referring to an aptitude rank of combined use of each of the multiple design information elements and design information elements identified with respect to another requirement among the multiple requirements, by using a second table. Then, the system design support apparatus outputs the design information elements, which are identified with respect to the multiple requirements, to a predetermined device.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for dynamically suggesting answers to questions submitted to a portal of an online service. These mechanisms and methods for dynamically suggesting answers to questions submitted to a portal of an online service can enable embodiments to provide help document suggestions with limited user input. The ability of embodiments to provide help document search term suggestions with limited user input can enable users to quickly and efficiently find useful help documents.

Abstract: Methods and systems are provided for querying a database. One exemplary method for obtaining data from an on-demand database supporting one or more tenants involves obtaining model database statistics based on expected utilization information for a tenant and providing the model database statistics to the on-demand database. The on-demand database utilizes the model database statistics to generate a query plan and executes the query plan to obtain data from the model database statistics.

Abstract: Aspects of the subject matter described herein relate to searching. In aspects, a software package may be received and transformed into searchable data. Static and dynamic analysis may be performed on code and data included in the software package. A data structure is created that may index the code, metadata, indexable resources, and analysis artifacts associated with the software package. The data structure may be used to satisfy queries and the transformed data and analysis artifacts may be made available for viewing.

Abstract: Embodiment described herein are generally directed to a toolbar extension of a web browser that grabs a user's search engine query and suggests a refined search query known to yield better search results. The toolbar recognizes the web page the user is on as being associated with a search engine and retrieves the user's search query. The toolbar interacts with a refinement component on a server, and the refinement component determines a refined search query based on confidence scores assigned to data mined from a data center affiliated with different search engine (one related to the toolbar). The refined search query is returned and displayed in a search field of the toolbar, allowing the user to easily run the refined search on the different search engine.

Abstract: In one aspect, data, such as information articles, is sorted and prioritized based on a plurality of factors, such as user interest and popularity of data with respect to other users. The data is sorted by initial personal (i.e., user) data, sorted by the most relevant to the user, while passive interaction data is used to continually reorder the articles in real-time, while new stories are being injected into the stream in real time, all while other articles are increasing/decreasing in stature based on popularity with regard to other users and time decay. As such, the system provides that the information is fed to users in an efficient manner, in a manner based on time relevance, assumed interest with regard to that given user based on past actions by that user or information otherwise known about that user, as well as interest in the articles demonstrated by other users.

Abstract: A method and system for visualizing a system. The method includes obtaining a context managed entity from a client system, wherein the context managed entity corresponds to software executing on a computer system, querying a managed entity repository to obtain a plurality of managed entities linked to the context managed entity, wherein the plurality of managed entities comprises a software managed entity and a hardware managed entity, and generating a node in a topology model object for each of the plurality of managed entities. The method further includes generating a link object in the topology model object for each link between managed entities in the plurality of managed entities and rendering a topology graph comprising each node and each link object in the topology model object.

Abstract: Methods, apparatus and software for classifying queries. In an aspect, for each of a plurality of queries, determines a first value based on a first number of occurrences for which the query was received for unfiltered search operations, and a determines a second value based on a second number of occurrences for which the query was received for filtered search operations. The method determines a first content type value based on the first value and the second value, and for each of the plurality of queries having a first content type value that meets a first threshold, classifies the query as a first content type seeking query, the classification being indicative of likely user interest in content of the first type.