Abstract: An interactive data object map system is disclosed in which large amounts of geographical, geospatial, and other types of data, geodata, objects, features, and/or metadata are efficiently presented to a user on a map interface. The interactive data object map system allows for rapid and deep analysis of various objects, features, and/or metadata by the user. A layer ontology may be displayed to the user. In various embodiments, when the user rolls a selection cursor over an object/feature an outline of the object/feature is displayed. Selection of an object/feature may cause display of metadata associated with that object/feature. The interactive data object map system may automatically generate feature/object lists and/or histograms based on selections made by the user. The user may perform geosearches, generate heatmaps, and/or perform keyword searches, among other actions.

Abstract: Search keyword recommendation includes: receiving a set of search keywords input by a user; determining whether the set of search keywords indicate a clearly defined intention by the user, including comparing the set of search keywords with a plurality of predetermined words corresponding to intentions that are not clearly defined; in the event that the set of search keywords are determined not to indicate a clearly defined intention, executing a first recommendation method to obtain recommended search keywords; wherein: the first recommendation method is selected among a plurality of recommendation methods; and the first recommendation method includes a knowledge-based recommendation method, a session correlation-based method, or a combination.

Abstract: One embodiment of the present invention provides a system that uses a known set of related terms to identify additional related terms in different languages. During operation, the system receives two terms that are known to be related. The system translates these two non-synonym terms into a given language, and then adds the translations of the two related terms to a list of known related pairs.

Abstract: After receipt of an instruction (e.g. a database statement), one or more computers specialize an interpreter with the received instruction as constant, to obtain a specialized interpreter that is stored in memory and/or disk. The specialized interpreter is then invoked to execute the received instruction. Depending on the embodiment, the interpreter being specialized may additionally be received and used in binary form without specialization. Specifically, in some embodiments, an identical interpreter is received in two forms: in a binary language specific to the one or more computers and also in a language that is acceptable to a specializer, such as a source language or an intermediate language. The interpreter in the binary language is invoked by default unless a predetermined condition for specialization is met. When the predetermined condition is met, the interpreter in the specializer-acceptable language is specialized by the specializer, and then the specialized interpreter is invoked.

Abstract: Constraints that restrict how corresponding identifiable groups of files are stored in a database, are enforced on corresponding file data. In response to a query on any data from an identifiable group of files, the effect of the constraint on how the corresponding data is stored is determined. The original query is rewritten, based on the effect of the constraint, so that the rewritten query is directed to a particular subset of the data stored in the database. Consequently, the search space is restricted to an identifiable subset of the database and execution of the rewritten query is more efficient than execution of the original query.

Abstract: A computer system and method provides access to Web (global computer network) services data of a target system. The target system exposes data through multiple web services. An application interface is adapted to interface with the target system re-using existing (predefined) web services among applications for the target system. The application interface queries the exposed data. A mapping member maps between application interface query of exposed data and syntax of objects useable in a subject application. The mapping member enables the subject application to access data of object instances generated in response to the query.

Abstract: A first word is acquired (S1), a plurality of relevant words associated with the acquired first word and containing a character string of the first word are generated (S3, S4), search results using the generated relevant words as search keywords are acquired (S5, S6), and search result information 40 is generated so as to display a search result 42 on a screen of a displaying means in accordance with each of the relevant words (S7, S8).

Abstract: Embodiments are directed towards generating data models that may give semantic meaning for unstructured data or structured data that may include data generated and/or received by search engines, including a time series engine. Data models also may be generated to provide semantic meaning to structured data. A data model may be composed of a hierarchical data model objects analogous to an object-oriented programming class hierarchy. Users may employ a data modeling application to produce reports using search objects that may be part of, or associated with the data model. The data modeling application may employ the search object and the data model to generate a query string for searching a data repository to produce a result set. A data modeling application may map the result set data to data model objects that may be used to generate reports.

Abstract: In a method and an apparatus (1) for searching in a memory-efficient manner for at least one query data element in a graph (2A), only as many data elements are read into a memory as are required for their subsequent processing. Increased memory efficiency is ensured as a result of this. The proposed apparatus is particularly suitable for use in terminals having very limited memory, in particular in mobile terminals.

Abstract: Embodiments are directed towards generating data models that may give semantic meaning for unstructured data or structured data that may include data generated and/or received by search engines, including a time series engine. Data models also may be generated to provide semantic meaning to structured data. A data model may be composed of a hierarchical data model objects analogous to an object-oriented programming class hierarchy. Users may employ a data modeling application to produce reports using search objects that may be part of, or associated with the data model. The data modeling application may employ the search object and the data model to generate a query string for searching a data repository to produce a result set. A data modeling application may map the result set data to data model objects that may be used to generate reports.

Abstract: Provided is mechanism for guiding computer searches (e.g., web, Internet, intranet . . . ). Machine learning and reasoning mechanisms are employed together with a search engine to facilitate intelligent guidance of queries and results based on a query and responses to computer generated inquires. Also, disclosed is a mechanism that enables users to validate computer-based information. Users can receive a validity metric associated with computer generated or provided results. Validation systems and methods are disclosed to facilitate determining the results including those that employ humans (e.g., referrals, voting . . . ) and/or automated ways (e.g., source analysis, data mining . . . ).

Abstract: A computer-implemented method for managing access to data stored in a database is provided. The method includes storing in the database a switch parameter having a first value, storing in the database at least two instances of a data object wherein each of the instances includes a unique identifier, receiving a client query from a requestor, determining by the computing device an active instance from the at least two instances based at least in part on comparing the first value of the switch parameter to the unique identifier of each instance, modifying by the computing device the client query at least in part based on the determined active instance to create a resultant query, executing the resultant query against the active instance to generate a resultant data, and providing the resultant data to the requestor.

Abstract: Information is stored in a data pattern. The data pattern includes an identity table, a version table that includes at least one reference to the identity table, and an audit table that includes at least one reference to the version table. The identity table stores information identifying the information. The version table stores version information identifying one or more versions of the information identified in the identity table. The audit table stores audit information identifying when each of the one or more versions of the information was modified. The audit table may also store effectiveness information identifying when each of the one or more versions of the information is in effect.

Abstract: A system and method of providing information to improve efficiency of human searchers obtaining information on behalf of users is described. A first responder to a request is provided with specialized tools for responding to a request. An initial evaluation of a query may be used to determine the responder and the type of tools which will be provided initially. A toolset which allows rapid responses based on data resources, common queries, and contextual information of a user, a request, partially matching queries and previous responses to previous queries is used to improve the probability that a first responder may provide a suitable response to a query.

Abstract: Methods, systems, apparatus, including computer program products, for providing fresh related search suggestions in response to a user submitted query are presented. In one implementation, a plurality of prior queries are selected wherein each of the prior queries was submitted as a search query a number of times during a recent time period and satisfies a criterion. For each of the prior queries, the prior is selected as a candidate query based on one or more of: a determination that search results responsive to the prior query include a number of news results that satisfy a second threshold, and relevance data indicative of user behavior relative to the search results responsive to the prior query. In response to receiving a user query, one or more candidate queries are selected that match the user query.

Abstract: Systems and methods for processing an index are described. A postings list of items containing a particular term are ordered in a desired retrieval order, e.g., most recent first. The ordered items are inserted into an inverted index in the desired retrieval order, resulting in an ordered inverted index from which items may be efficiently retrieved in the desired retrieval order. During retrieval, items may first be retrieved from a live index, and the retrieved items from the live and ordered indexes may be merged. The retrieved items may also be filtered in accordance with the items' file grouping parameters.

Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving a structured query that includes references to selected nodes and edges, and generating one or more query modification for the structured query, where each query modification includes references to modified nodes or modified edges from the plurality of nodes and edges.

Abstract: A method and system for implementing virtual primary keys in databases of an enterprise network system includes generating virtual primary keys indexed to respective native primary keys. An enterprise application may reference a virtual primary key in a database query. The virtual primary key may be translated to a native primary key for a database that the database query was intended for. The translated database query may be sent to the database. The query response may be translated from the native primary key to the virtual primary key, before sending back to the enterprise application.

Abstract: There is provided a method for searching a database to obtain data. The method includes (a) prioritizing a set of keys that are derived from a match inquiry, thus yielding a prioritized set of keys, wherein the prioritizing is based on, for each key of the set, an efficacy of using the key, (b) determining a subset of the prioritized set, and (c) retrieving, using the subset, a set of candidates for satisfying the match inquiry.

Abstract: A query engine for integrating authorization conditions within a database query statement. The query engine may include an authorization handler configured to receive authorization parameters related to one or more authorization objects for data relevant to a query for performing an authority check, and obtain at least one user authorization profile for a current user based on the authorization parameters. The at least one user authorization profile may include an activity value and one or more authorization conditions associated with the activity value. The query engine may further include a query generator configured to receive query parameters related to the query and integrate the query parameters with the one or more authorization conditions to obtain a database query statement, and a database selector configured to obtain authorized data from an in-memory database based on the database query statement.

Abstract: Distributed storage systems support SQL while also providing scalability and fault tolerance by utilizing an SQL library (the SQL execution component) layered on top of a transactional key-value system (the storage component). The SQL library comprises a parser and an execution engine running at the client, while the storage component comprises a key-value system for storing the data. The SQL library parses SQL queries received from client applications and maps them to transactions on the key-value system. The key-value system stores data items identified by key and provides concurrency control mechanisms to handle concurrent transactions. The key-value system may be a distributed system with several storage servers, each attached to one or more storage devices.

Abstract: A device may facilitate a query dialog involving queries that successively modify a query state. However, fulfilling such queries in the context of possible query domains, query intents, and contextual meanings of query terms may be difficult. Presented herein are techniques for modifying a query state in view of a query by utilizing a set of query state modifications, each representing a modification of the query state possibly intended by the user while formulating the query (e.g., adding, substituting, or removing query terms; changing the query domain or query intent; and navigating within a hierarchy of saved query states). Upon receiving a query, an embodiment may calculate the probability of the query connoting each query state modification (e.g., using a Bayesian classifier), and parsing the query according to a query state modification having a high probability (e.g., mapping respective query terms to query slots within the current query intent).

Abstract: Techniques for using metadata as comments to assist with search problem determination and analysis are provided. Before an action is taken on a search, contextual information is gathered as metadata about the action and actor requesting the action. The metadata is embedded in the search as comments and the comments are subsequently logged when the action is performed on the search. The comments combine with other comments previously recorded to permit subsequent analysis on searches.

Abstract: An approach for building an ontology is provided. Based on a grammar, extracted complex triples are syntactically transformed to identify core terms. The syntactically transformed complex triples are semantically transformed into simplified triples referring to new terms that conceptualize the core adjectives, adverbs and verbs, and assigning the core terms to respective definitions and keys in a reference ontology, thereby retaining the semantics of the complex triples. Based on a meta-schema of the reference ontology, an enrichment transformation of the simplified triples is performed to create simplified and enriched triples by adding relations derived from a correspondence each term in the simplified triples has with the reference ontology and by adding representations of semantics of reference ontology definitions of the terms. The simplified and enriched triples are stored as an ontology representing knowledge in an application providing the free-form text from which the complex triples were extracted.

Abstract: Provided is a search result providing system and method for providing a loan word pronunciation service. The search result providing system includes a storage device, an original word-allomorph maintaining unit configured to store an original word, a loan word corresponding to the original word, and a first allomorph of the original word; a related loan word searching unit configured to find a related loan word from the original word-allomorph maintaining unit in response to a query, in which the related loan word is related in pronunciation with at least one of the original word, the loan word, and the first allomorph; and a related loan word providing unit configured to expose at least one related loan word as a search result.

Abstract: Target word recognition includes: obtaining a candidate word set and corresponding characteristic computation data, the candidate word set comprising text data, and characteristic computation data being associated with the candidate word set; performing segmentation of the characteristic computation data to generate a plurality of text segments; combining the plurality of text segments to form a text data combination set; determining an intersection of the candidate word set and the text data combination set, the intersection comprising a plurality of text data combinations; determining a plurality of designated characteristic values for the plurality of text data combinations; based at least in part on the plurality of designated characteristic values and according to at least a criterion, recognizing among the plurality of text data combinations target words whose characteristic values fulfill the criterion.

Abstract: Described herein is a technology for facilitating searching and matching of data. In some implementations, an input data string, including one or more ideographic elements, is received and converted to a Latin-based input data string. One or more input keys may be generated based on the Latin-based input data string. A reference database may be searched for one or more candidate records indexed by at least one of the one or more input keys. If the one or more candidate records are found, a match score is determined for the one or more candidate records.

Abstract: Some embodiments relate to performing a search for content via the Internet, wherein user input specifying a search query is supplied to a mobile communications device, such as, for example, a smartphone. The mobile communications device separately issues the search query to a plurality of search engines and can receive the results from each search engine and display the results to the user. Thus, the user does not have to separately issue the query to each of the plurality of search engines.

Abstract: A dynamic document template contains a set of queries. Each query may include a query scope. The query scope may refer to a content of a source document that is maintained in a document collection. A content rule is applied to monitor the template for a change. A notification event is triggered when a change to the document collection results in an invalid query scope in the template. A notification event may also be triggered when a change to the document collection results in valid query but the template needs to be refreshed. An additional notification event may be triggered if the template is modified so that the resulting template is either invalid or needs to be refreshed with different content from the collection.

Abstract: A method for searching a mailbox of a user to identify and present results relevant to the user's requirements. The mailbox comprises a plurality of e-mails. The method comprises receiving an input from the user specifying the user's requirements. The received input is used to identify one or more contexts of a search. The search is then conducted in the mailbox based on the identified context(s) to identify one or more results relevant to the input. The results are e-mails and/or e-mail attachments that match the user's requirements. The identified results are then ranked according to the extent of relevance to the received input. The results are ranked based on a plurality of pre-defined conditions. The results are then presented to the user on a display at the computer according to the ranking.

Abstract: The database command rewriting system rewrites a first database command that includes language specific for a first database management system command into a second database command suitable for a second database management system. The database command rewriting system receives the first database command and identifies the specific language. Furthermore, the database command rewriting system retrieves a rule based on the identified language. Using the retrieved rule, the database command system rewrites the first database command to the second database command and transmits the second database command to the second database management system.

Abstract: Method and system to search for data objects are provided. The method comprises generating an attribute index and a content index. The attribute index comprises entries associated with respective access control information for a set of data objects and generating. The content index comprises words from the set of data objects. A search query directed at the set of data objects is processed by searching the content index, searching the attribute index, and obtaining a search result based on the results of searching of the content index and the attribute index.

Abstract: Concepts and technologies are described herein for reducing locking during database transactions without using a cache. In accordance with the concepts and technologies disclosed herein, a server application generates a changeset in response to receiving an operation for modifying base data stored in a database. The changeset is stored as a set of tables that are stored at the database with the base data, and include a first table reflecting records in the base data that have been created and/or modified by the operations. The changeset further can include a second table reflecting records in the base data that have been deleted by the operations.

Abstract: The present disclosure discloses a mobile communication device comprising a local common address database object accessible to at least one application; a communication subsystem for communicating with a network; and a database querying logic module. The database querying logic module, in conjunction with the at least one application, is operable to receive a query relating to an address record; determine that no record in a local common database disposed on the mobile communications device meets the conditions of the received query; query, via the network, a remote database for at least one remote matching record meeting the conditions of the received query; receive, via the network, the at least one remote matching record; and update the local common address database object to incorporate the at least one remote matching record.

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: A search method for improving a user's search intention is disclosed. The search method includes a user interface for receiving a search request, input terms connected by input operators, and means for a user to visually associate input terms with an order of query operations.

Abstract: Methods and apparatus for processing autocomplete suggestions. Some implementations are directed to methods and apparatus for generating additional suggestions for provided multiple term autocomplete suggestions and determining additional suggestion scores for the additional suggestions. Like entries among the additional suggestions and the autocomplete suggestions may be identified and each similar grouping of the like entries combined into a consolidated entry. A combined consolidated score for each consolidated entry may be determined based on one or more of the additional suggestion scores and any of the autocomplete scores of the like entries combined into the consolidated entry.

Abstract: Queries targeting various data sources are processed in a query processing pipeline that parses the query into a set of operations (e.g., an expression tree or a translated SQL query) using a set of query operators, each handling a particular type of operation. The query operators are often designed in an unspecialized manner, such that each query operator handles one query operation in an atomic, generic manner (e.g., sorting generic data items for an ORDER BY clause.) More efficient queries may be devised by including specialized queries that operate in common but special cases, such as a sorting of a particular data type (e.g., a floating-point number sort) or a sequence of two or more operations that are often performed together (e.g., a WHERE test of an attribute followed by a SELECT of the same attribute.) The use of specialized operators may result in the formulation of more efficient queries.

Abstract: The system and method in one aspect provide a set of extended Boolean operators and a tree visual paradigm that enable business users to modularize the construction of a rule and visualize it as the rules is being built.

Abstract: Techniques involving an abstract derived entity. The abstract derived entity is a data object present in an abstract data model that may be referenced by other entities in the abstract data model as though it were a relational table present in a physical data source. The abstract data model provides data access independent of the manner in which the data is physically represented in a set of physical data sources. The abstract derived entity may be used to provide aggregate data joined with other non-aggregate data. The abstract derived entity may describe a relational table comprising a set of aggregate data used to form a column of the relational table joined to other columns formed from the sets of input data specified by the abstract derived entity. The resulting abstract derived table may be queried as though it were an actual relational table stored in a physical data source.

Abstract: Conceptually related term identification technique embodiments are presented that involve identifying in the results of a search query, terms that are conceptually related to the search query terms. In one general embodiment, this is accomplished by first inputting the terms employed in a search query and the results of the search. Word tokens found in the search query terms are then identified, as are potential phrases that can be made from the identified word tokens. Conceptually related words and phrases are then identified in the search query results. These words and phrases correspond to the previously identified word tokens and potential phrases. The search query results are presented to a user on a display device in such a manner as to visually distinguish the conceptually related words and phrases from other words and phrases in the search query results.

Abstract: A system includes reception of a query comprising one or more search terms, determination that one of the one or more search terms corresponds to a table column comprising Boolean operators, determination of a value of the table column corresponding to TRUE, and addition of a condition to the query, the condition specifying the value of the table column.

Abstract: This invention relates to an advertisement machine which provides advertisements to a user searching for desired information within a data network. The machine receives, from a user, a search request including a search argument corresponding to the desired information and searches, based upon the received search argument, a first database having data network related information to generate search results. It also correlates the received search argument to a particular advertisement in a second database having advertisement related information. The search results together with the particular advertisement are provided by the machine to the user.

Abstract: Methods for using task-related information to enhance digital searching are provided. A task-oriented user activity system maintains task-related information about resources accessed by a user and current user task. This task-related information is used to enhance search queries to include task-related search criteria that improve relevance of search results. The task-related information can also be used to include task-related metadata in search engine index, e.g., by storing the metadata in the index or by storing it in resources which are subsequently indexed. Task-related information can also be used to enhance search results by filtering and ranking results to increase relevance with respect to a user's current task.

Abstract: Methods and systems for query optimization for a multi-tenant database system are provided. Some embodiments comprise receiving at a network interface of a server in a multi-tenant database system an original query transmitted to the multi-tenant database system by a user associated with a tenant, wherein the original query is associated with data accessible by the tenant, and wherein the multi-tenant database system includes at least a first index and a second index. Metadata associated with the data is retrieved, wherein at least a portion of the data is stored in a common table within the multi-tenant database system. A tenant-selective query syntax is determined by analyzing at least one of metadata generated from information about the tenant or metadata generated from the data accessible by the tenant.

Abstract: A content search system includes multiple pipelined search engines that implement different portions of a regular expression search operations. For some embodiments, the search pipeline includes a DFA engine, an NFA engine, and a token stitcher that combines partial match results generated by the DFA and NFA engines in a manner that prevents either engine from becoming a bottleneck. In addition, the token stitcher can be configured to implement unbounded sub-expressions without utilizing resources of the DFA or NFA engines.

Abstract: Methods and systems for knowledge discovery and organization employ a relational meta model and domain context-based knowledge inference engine to produce answers to queries that involve inferences among items stored as knowledge in a knowledgebase.

Abstract: Enhanced methodology and apparatus for use in a multi-player video game for generating a array of user selectable options for choosing real or computer generated users to play with and/or compete against. For example, in a simulated multiple driver racing game application, the user of a computing device is presented with an option for selecting any of various “ghost data” packages for downloading over a communication network such as the Internet. For example, the user may be presented with the option of selecting one of an array of ghost data packages to race against such as the top five buddies of the user with highest scores, five buddies with scores similar to a user's own score, and teams/groups of various varieties.

Abstract: Embodiments of the invention disclose a method, identifier and a computer program product for identifying influential users among a group of users associated with a communication network. The disclosed method includes selecting two or more ranking models from a plurality of ranking models such that each ranking model provides scores to the users in the group based on a usage data of the users, calculating a weighing factor for each of the selected ranking models, generating an aggregate score for each user using the weighing factor and the score provided by each one of the selected model such that based on the aggregate score, the influential users among the group of users are identified.

Abstract: In accordance with the teachings described herein, systems and methods are provided for performing index joins. A database management application may receive an instruction to perform an index join operation between columns in a first table and a second table, wherein the database management application does not have direct access to an index of the first table or the second table for performing the index join operation. A query may be automatically generated by the database management application, wherein the query includes a where clause equality expression that equates an indexed column of the second table with a parameter or updatable constant. The database management application may substitute a value from a row of the first table may for the parameter or updatable constant, and cause the query to be executed on the index of the second table to fetch any one or more rows of the second table that satisfy the where clause by having an index value that matches the substituted value.