Abstract: A database benchmark configuration is selected via an interface. At least one database partitioning scheme from a plurality of database partitioning schemes is selected via the interface. The selected database partitioning scheme is configured through the interface. The selected database partitioning scheme is evaluated based on the configuring step and the selected database benchmark configuration, and evaluation results are generated. A presentation is generated for the interface based on at least a portion of the evaluation results, wherein the presentation is configured to provide at least an indication of a performance of the selected database partitioning scheme given the configuring step and the selected database benchmark configuration.

Abstract: Embodiments of the invention dynamically vary the number of replicas based on certain conditions to protect users from data loss. The size of the database is one condition that can be used to determine the number of replicas required. A database system may create three replicas. When the database size exceeds a first threshold, a fourth replica may be created. The fourth replica is maintained as long as the database size is above a second threshold that is smaller than the first threshold. However, when the database shrinks below the second threshold, then the fourth replica is deleted. Using two different thresholds in this manner prevents the system from frequently cycling between three and four replicas.

Abstract: Excess capacity of a database system can be used for learning activities in a controlled computing environment. In this context, excess capacity of a database system can be used as needed and/or on a temporary basis. Furthermore, learning activities can be performed without requiring the use of the capacity that is configured or has been allotted for various other database operations, including those deemed, especially by the users of database system, to serve a main function or a more important purpose. As a result, learning can be performed without adversely affecting other operations deemed to be more critical, especially by the users of databases. Learning activities associated with a database environment can, for example, include learning operations directed to optimization of database queries, for example, by using a basic feedback or an expanded or active learning.

Abstract: A method and apparatus for automatically analyzing and providing feedback regarding the optimizability of a relational database query. A query developer's primary goal is to ensure that queries and DML operations are rewritten for the most efficient execution. Rewrite diagnosability captures metadata for each attempted query optimization including success or failure and the reasons for failure. The metadata is stored in association with the operators that were not removed through rewriting. Once all optimizations have been attempted and rewriting is complete, the metadata is selectively displayed based on the cost to perform the associated operation. The context of performing the operation may affect the cost. The cost may be based at least on the type of operation and where within the query tree the operation is located. A query developer may configure the database system not to execute the resulting query plan based on one or more criteria.

Abstract: Computing capacity of a computing environment can be managed by controlling it associated processing capacity based on a target (or desired) capacity. In addition, fine-grained control over the processing capacity can be exercised. For example, a computing system can change the processing capacity (e.g., processing rate) of at least one processor operating based on a target capacity. The computing system may also be operable to change the processing capacity based on a measured processing capacity (e.g., a measured average of various processing rates of a processor taken over a period of time when a processor may have been operating at different processing rates over that period). By way of example, the processing rate of a processor can be switched between 1/8 and 2/8 of a maximum processing rate to achieve virtually any effective processing rates between them.

Abstract: A search query is received. Personal information for a user is then determined. A search is performed in a general subdomain of general content using the search query. For example, the general subdomain of general content may be a WWW search. Then, a vertical subdomain is determined based on the personal information. A search is then performed in the vertical subdomain of specialized content using the search query. The search performed in the general subdomain and the search performed in the vertical subdomain generate general search results and vertical search results. The results may be combined and outputted to a client.

Abstract: Embodiments of the present disclosure provide a method and system for generating a webpage using one or more terms in a hierarchical taxonomy. Specifically, embodiments provide for identifying an item in a database where the item is associated with at least one term in a term set having a hierarchical structure. A uniform resource locator is generated for the webpage using the at least one term and the hierarchical structure associated with the at least one term. An identifier associated with the item is then determined and appended to the generated uniform resource locator.

Abstract: Excess capacity available to a database system in a capacity controlled environment can be effectively managed. In particular, excess capacity that is not made available for normal operations of a database system can be used to manage errors, especially situations that may hinder expected performance of the database system. In addition, excess capacity can be used to optimize or further optimize database queries, especially those that meet a criterion (e.g., not fully optimize, not optimized as expected).

Abstract: A computer-implemented method for presenting an entertainment requester with a selection of entertainment events comprises determining a geographic location of the entertainment requester and conducting, with the aid of a processor, a search for at least one entertainment event within a search area encompassing in whole or in part the geographic location of the entertainment requester. A geographic location of one or more entertainment events revealed upon the search is then displayed to the user on a graphical user interface (GUI) of an electronic device of the entertainment requester. The entertainment requester may then check into an entertainment event selected from the one or more entertainment events.

Abstract: Methods and apparatus consistent with the invention allow a user to submit an ambiguous search query and to receive relevant search results. Queries can be expressed using character sets and/or languages that are different from the character set and/or language of at least some of the data that is to be searched. A translation between these character sets and/or languages can be performed by examining the use of terms in aligned text. Probabilities can be associated with each possible translation. Refinements can be made to these probabilities by examining user interactions with the search results.

Abstract: Features are disclosed for automatically facilitating knowledge sharing using information collected during meetings. Collected information may include both the content and context of a meeting. The meeting content may comprise text collected by automatic speech recognition or entered manually at a user device. The meeting context may comprise information such as the identities of meeting participants and subject matter from a meeting agenda. The content and context information may be used to identify relevant topics for which knowledge is available, and the available knowledge may be presented to one or more of the meeting participants.

Abstract: Systems and methods for storing and retrieving geospatial data in a geographic information system are provided. Geospatial data can be spatially partitioned along axes of a spherical coordinate system associated with a virtual globe or other spheroid into a plurality of discrete geospatial volumes pursuant to a hierarchical spatial partitioning scheme. For instance, geospatial data can be spatially partitioned into geospatial volumes along surfaces of constant latitude, longitude, and altitude defined by the spherical coordinate system. The discrete geospatial volumes can be stored as nodes in a hierarchical tree data structure. Additional methods are provided for portioning geospatial objects, such as tiles or discrete geospatial volumes, in tritree to reduce polar distortions.

Abstract: A computer-implemented method and system for enabling communication between networked users based on search queries and common characteristics is disclosed. Particular embodiments relate to receiving a search query from a first user and establishing a communication link between the first user and a second user based on the first user's search query. Particular embodiments relate to receiving a first search query from a first user, receiving a second search query from a second user, determining if the first user and the second user fit within match criteria, and establishing a communication link between the first user and the second user if the first user and the second user fit within match criteria.

Abstract: Journaling technology, in which a tool, that is separate from a journaling process executed by a server system, causes display of an interface that enables user selection of information derivable from journaling data collected by the journaling process. The tool receives, through the displayed interface, user input selecting desired information derivable from the journaling data collected by the journaling process. Based on the user input, the tool determines one or more commands that are understood by the journaling process and that control the journaling process to retrieve journaling data needed to derive the desired information. The tool controls the journaling process to execute the one or more commands, accesses journaling data retrieved through execution of the one or more commands, and reformats the accessed journaling data into a presentable format of the desired information.

Abstract: According to an embodiment of the present disclosures, systems, methods, and non-transitory computer-readable mediums having program instructions thereon, provide for process of segregating data from database tables into different layers depending on the frequency of access to the data—so that each layer of the data can be stored in an appropriate storage mechanism. For example, infrequently-accessed data can be stored in a hard disk drive (HDD) and frequently-accessed can be stored in random-access memory (RAM). Further, the data can also be stored in a sold-state drive (SSD) or other memory-storing devices. In an embodiment, grading attributes are used to layer the data and, accordingly, segregate the data into appropriate storage mechanisms.

Abstract: Various embodiments provide for use of multiple different search engines. The individual search engines are configured to conduct searches in different ways across a search space that includes different types of data sets. In at least some embodiments, the type of search engine that is utilized is selected to due characteristics of the data set(s) that is (are) to be searched. In search spaces that include different types of data sets, combining and mixing different search engines to collectively search the search space can provide a desirably fast and robust user experience.

Abstract: An embodiment of the method of processing communication data to identify one or more themes within the communication data includes identifying terms in a set of communication data, wherein a term is a word or short phrase, and defining relations in the set of communication data based on the terms, wherein the relation is a pair of terms that appear in proximity to one another. The method further includes identifying themes in the set of communication data based on the relations, wherein a theme is a group of one or more relations that have similar meanings, and storing the terms, the relations, and the themes in the database.

Abstract: A search query is received. Personal information for a user is then determined. A search is performed in a general subdomain of general content using the search query. For example, the general subdomain of general content may be a WWW search. Then, a vertical subdomain is determined based on the personal information. A search is then performed in the vertical subdomain of specialized content using the search query. The search performed in the general subdomain and the search performed in the vertical subdomain generate general search results and vertical search results. The results may be combined and outputted to a client.

Abstract: A method for use in analyzing tenant-specific data is disclosed. First data for a first tenant and second data for a second tenant is stored in a multi-tenant data storage system. A first portion of the first data is selected. Based on the selection, the first portion of the first data is copied to a data store that is specific to the first tenant. Data analysis techniques are applied to the data store.

Abstract: According to one embodiment, an output unit performs filtering on input data for each filtering condition for performing data filtering and outputs a result of the filtering to an output destination. A receiving unit receives information indicating whether the output result of the filtering is appropriate or inappropriate from the output destination. A cumulative counting unit cumulatively counts the numbers of times determined to be appropriate and appropriate for each filtering condition based on the received information. A switching unit switches the filtering at the output unit between being valid and invalid for each filtering condition based on cumulative values of the numbers of times the output result of the filtering for each filtering condition has been determined to be appropriate and inappropriate and a switching condition that switches the filtering condition between being valid and invalid.