Abstract: One or more parameters of one or more processes identified as belonging to a specific process grouping among a plurality of process groupings are obtained. Eligible token words in the one or more parameters are identified. The eligible token words are processed to select a subset within the eligible token words that are likely descriptive of the specific process grouping. The selected subset within the eligible token words is utilized to determine a descriptive identifier associated with the specific process grouping.

Abstract: Some embodiments of the teachings herein include a computer-implemented method for automatic derivation of attributes of software engineering artifacts arising from technical boundary condition of product or service development segments comprise: deducing technical requirements using an automated software-based process based on classifications of the technical boundary conditions; mapping the deduced technical requirements of the artifacts to engineering disciplines and concerns using an automated software-based process; mapping the calculated engineering artifacts to responsibilities; adapting the classification of the technical boundary conditions based on the evaluation results in iterations; and processing an executable performing a distribution calculation of the classification space, wherein the distribution calculation of the classification space is at least based on a distribution and quartiles.

Abstract: An approach for ontological policy based data collection, processing, and negotiation for data in view of analytics is provided. The approach searches one or more data sources for data related to a data request. The approach collects data related to the data request from the one or more data sources. The approach determines whether one or more attributes generated from the data request match one or more descriptors associated with the data related to the data request. The approach creates one or more annotated ontologies for the data related to the data request. The approach displays a hierarchical visualization of the one or more annotated ontologies for the data related to the data request. The approach updates the one or more annotated ontologies for the data related to the data request based, at least in part, on an evaluation of the quality of the one or more data selections.

Abstract: A method in a data processing system and apparatus for organizing files, data items, web site members, or web pages, structured or unstructured, of multiple users stored across one or more server computers into hierarchical file structures on a recordable medium of a data processing system. A user-defined metalabel is assigned to each of the electronic files, data items, web site members, or web pages. The electronic files, data items, web site members, or web pages are organized as a function of the metalabels into the hierarchical file structures. The method includes automatically forming personalized hierarchies, such as a shadow copy for a second user, from the user-defined metalabels of a first user according to a user profile. The method includes automatically forming keywords of strings of at least two user-defined metalabels or a portion thereof, and automatically forming search structures of the keywords existing simultaneously with the plurality of hierarchical structures.

Abstract: A random number generation process generated uncorrelated random numbers from identical random number sequences on parallel processing database segments of an MPP database without communications between the segments by establishing a different starting position in the sequence on each segment using an identifier that is unique to each segment, query slice information and the number of segments. A master node dispatches a seed value to initialize the random number sequence generation on all segments, and dispatches the query slice information and information as to the number of segments during a normal query plan dispatch process.

Abstract: A method, system, and computer program product for normalized ranking of semantic query search results. The method commences by forming a SPARQL query, the SPARQL query specifying a collection of named RDF graphs, then executing the SPARQL query to retrieve matched documents selected from the collection of named RDF graphs. Having retrieved the matches, the method calculates an absolute normalized score for the matched document. The calculation of an absolute normalized score for a second matched document allows for relevance ranking. To enhance the relationship of the computer-calculated score to the relevance (and not solely to occurrence counts) embodiments consider the number of distinct variables selected in the SPARQL query, and also consider the total number of bindings to the aforementioned variables. For comparing from among possibly different sized documents, a further normalization component is implemented by considering the total number of triples found in the document's underlying subgraph.

Abstract: A system includes a database that stores attributes of applications that are descriptive of source code included in the applications and identification data that identifies the applications to which the attributes apply. The attributes are mined through a programmatic analysis of one or more repositories in which the applications are stored, and the programmatic analysis includes programmatic analysis of the source code included in the applications to derive the attributes. The system also includes a computer system configured to handle queries against the attributes of the applications stored in the database and provide output based on the handling of queries against the attributes of the applications stored in the database.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving a search query; generating search results based on the search query; determining that a number of the search results is greater than a threshold; determining a category for each of the search results from among a plurality of categories; and transmitting the search results with instructions to display each of the search results based on its determined category.

Abstract: Methods for leveraging a user's social network connections to search files stored on client devices are provided. Upon receipt of a search query, it is determined that the searching user is a social network connection of at least one user of a social networking application having files on their client device designated for sharing. Those designated files are searched to determine if any of them match the received search query. Client device files associated with users of the social networking application that have been designated for public sharing also are searched. Any files shared publicly or with social network connections of the sharing user that are stored on a client device and determined to match the received query may be presented to the searching user independent of the algorithmic search results or may be integrated into the algorithmic search results, as desired.

Abstract: Embodiments of the present invention relate to an approach for reusing information/knowledge. Specifically, embodiments of the present invention provide an approach for retrieving previously stored data to satisfy queries (e.g., jobs/tickets) for solutions to problems while maintaining privacy/security of the data as well as ensuring the quality of the results. In a typical embodiment, a query for a solution to a problem is received and details are extracted therefrom. Using the details, a search is performed on a set of data stored in at least one computer storage device. Based on the search, a set of results will be generated and classified into a set of categories. In any event, the quality of each of the set of results will be assessed based on the usefulness of the set of results.

Abstract: Some embodiments include a method for searching a hierarchical database structure of a database management system. In some embodiments, the method comprises detecting text input in a database search field, wherein the text input defines a search for data in the hierarchical database structure, wherein the hierarchical database structure includes items, and wherein the items include one or more of actions to be performed on data in the hierarchical database structure, indexes for looking up data in the hierarchical database structure, and database schemas defining databases in the hierarchical database structure. The method can also comprise selecting items in the hierarchical database structure based on the text input; presenting selectable options, wherein the selectable options are associated with the items in the hierarchical database structure; detecting selection of one of the selectable options, and presenting data associated with the one of the items.

Abstract: In response to a query having a search term, an inverted index that is defined on a set of attributes of a database structure is accessed, where the inverted index associates values of the set of attributes with corresponding references to rows of the database structure. It is determined whether any of the attributes in the set is in the search term. In response to determining that any of the attributes in the set is in the search term, the inverted index is used to produce an answer to the query.

Abstract: Methods, systems, and techniques for keyword management are described. Some embodiments provide a keyword management system (“KMS”) configured to determine the effectiveness of multiple candidate keywords. In some embodiments, the KMS generates multiple candidate keywords based on an initial keyword. The KMS may then determine an effectiveness score for each of the candidate keywords, based on marketing information about those keywords. Next, the KMS may process the candidate keywords according to the determined effectiveness scores. In some embodiments, processing the candidate keywords includes applying rules that conditionally perform actions with respect to the candidate keywords, such as modifying advertising expenditures, modifying content, or the like.

Abstract: A computer implemented method and system for identifying one or more part numbers stored in a digital memory comprises parsing of each part number into its primary and secondary components and assigning a relevance score to each; parsing a query part number into one or more primary and secondary components and assigning a relevance score to each query component; identifying each stored part number that has at least one component that matches a query component; calculating for each identified part number a first sum equal to the sum of the relevance scores of the query components that match a component of the identified stored part number; and a second sum equal to the sum of the relevance scores of the components of the identified stored part number that match a query component; and sorting the identified stored part numbers as a function of said first and second sums.

Abstract: An e-book server creates index information for encrypted e-book content. The index information is used by a reader module to efficiently search the encrypted content. To create the index information, the e-book server identifies logical partitions of an e-book that include phrases, and creates encrypted segments including a portion of the e-book content that is not necessarily aligned with the logical partitions of the e-book. The e-book server then stores index information including a mapping between the encrypted segments and the phrases located in the logical partitions.

Abstract: The invention relates to searching structured data using natural language searches. More specifically and preferably, the invention relates to the use of an inverted file index built from generated documents to make data, typically unsearchable using a natural language search, searchable.

Abstract: The subject disclosure is directed towards enriching database query responses using data from external data sources. When processing a database query seeking enriched data from an external data source, a request is communicated to the external data source based on the database query. An enriched database query response is generated based on data provided by the external data source. The enriched database query response may be combined with data returned via an internal database query operation, and/or inserted into a local database table.

Abstract: Expertise mining features are provided based in part on the use of an expertise mining algorithm and expertise mining queries. A method of an embodiment operates to provide an expanded feedback query based in part on search results using an expertise mining query and a number of author-ranking heuristics used to rank authors and/or co-authors (e.g., primary authors, secondary authors, etc.) as part of an expertise mining operation. A search system of an embodiment includes an author ranker component to rank authors based in part on an expertise mining query and author-ranking heuristics, and a query expander component to provide expanded queries as part of identifying relevant search results. Other embodiments are also disclosed.

Abstract: Techniques are described for managing query execution by estimating and monitoring query execution time. Embodiments of the invention may generally receive a query to be executed and calculate an initial estimated execution time for the received query. If the initial estimated execution time does not exceed a threshold amount of time, embodiments of the invention may submit the query for execution. Once execution of the query has begun, embodiments of the invention may calculate an updated estimated execution time for the executing query, and if the updated estimated execution time exceeds the threshold amount of time, may halt the execution of the query.

Abstract: Methods and systems for searching over a large corpus of data to discover relevant information artifacts based on similar content and/or relationships are disclosed. Improvements over simple keyword and phrase based searching over Internet scale data are shown. A search query may be modified or relaxed based on the search terms and a contextual relationship therebetween. The search results may be ranked based on both a data ranking corresponding to the data entries in the corpus and a query ranking corresponding to the search query and/or the modified or relaxed search query. In this manner, the accuracy and relevance of the search results is improved.

Abstract: There is provided a computer-implemented method of modifying a query executing in a database management system. The method comprises sending a no-wait message for the query to a control broker. The method also comprises receiving a reply to the no-wait message from the control broker. The reply to the no-wait message specifies a modification to the query. Additionally, the method comprises performing the modification.

Abstract: A system and method are proposed for identifying multimedia files in a first database which are related to a textual term specified by a user. The textual term is used to search a second database of multimedia files, each of which is associated with a portion of text. The “second database” is usually composed of files from the databases of a very large number of servers connected via the internet. The multimedia files identified in the search are ones for which the corresponding associated text is relevant to the textual term. The identified multimedia files are used to generate a classifier engine. The classifier engine is then applied to the first database of multimedia files, thereby retrieving multimedia files in the first database which are relevant to the textual term. The user can optionally specify whether the retrieved multimedia files are relevant or not, and this permits a feedback process to improve the classifier engine.

Abstract: This is directed to processing stored data to automatically generate metadata for the stored data. In particular, this is directed to identifying metadata associated with stored data, and identifying other data that relates to the stored data from one or more sources. A processing module can identify other data sharing some of the identified metadata, and can extract additional metadata associated with the identified other data. The extracted metadata can then be associated with the user's stored data. The processing module can extract additional metadata from any suitable source, including for example local application data, social networks or blogging sources, and other remote sources. In some embodiments, an electronic device can retrieve data from other users for a particular event based on metadata associated with the user's data for the event to form a master collection of data.

Abstract: A method, system, and apparatus are directed to providing information over a network. A search query may be received. If the search query includes at least one keyword matching a pattern associated with a specific search engine, a plurality of search results is retrieved from the specific search engine based on the keyword, and the plurality of search results is provided. A plurality of potential search or source engines may be determined based on a current time information. At least one of the potential search or source engines may be a personalized source engine. At least one plurality of results may be retrieved from at least one of the potential search or source engines. The result may be based on the search query. An aggregated result may be determined based on a time rule and/or the current time information. The aggregated result may comprise the plurality of results.

Abstract: A method of incrementally refining queries and updating query result lists without requiring a user to provide an explicit indicator of query submission. In the method, one or more query related character patterns are defined. Entry of query defining characters by a user is monitored to detect entry of a defined query related character pattern. The user is provided with one or more suggested query refinement options and an updated query result list each time a defined query related character pattern is detected. The query related character patterns may be a character pattern that indicates a word has been input by the user.

Abstract: In a medical information system, with respect to a plurality of kinds of medical databases, a plurality of search items included in a search query inputted by a user are sorted in accordance with search divisions, and thereby divided into a finding report search query and a specimen test query. By using these queries, the corresponding databases are searched independently, and individual search results obtained therefrom are combined to generate a combined search result. The individual search result is assigned with an individual score in accordance with the matching degree with the search item. In combining the individual search results, a relevancy score is assigned. The search results are ranked and combined in descending order of the scores. This requires only one issuance of a search execution order without the need to perform a search operation a plurality of times, in order to obtain a desired search result.

Abstract: Embodiments include applications as participants in a communication session such as a voice call. The applications provide functionality to the communication session by performing commands issued by the participants during the communication session to generate output data. Example functionality includes recording audio, playing music, obtaining search results, obtaining calendar data to schedule future meetings, etc. The output data is made available to the participants during the communication session.

Abstract: Optimizing data rendering includes, in one embodiment, using templates to express a data request as a set of queries where each query in the set is prioritized based on, among other things, context factors such as capabilities of the requesting device, network factors, and user context. After generating the set of queries, each query in the set of queries is then executed to progressively populate the template with the requested data. As the queries are executing, the templates are progressively rendered.

Abstract: Systems, methods, software and computer-usable media for annotating biomolecule-related data are disclosed. In certain exemplified embodiments, the biomolecules can be nucleic acids and the data can be sequence-related data. In various embodiments, systems can include one or more public or private biological attributes (e.g., annotation information databases, data storage devices and systems, etc.) sources, one or more genomic features data sources (e.g., genomic variant tools, genomic variant databases, genomic variant data storage devices and systems, etc.), a computing device (e.g., workstation, server, personal computer, mobile device, etc.) hosting an annotations module and/or a reporting module, and a client terminal.

Abstract: A method for determining legal experience including determining a count of times each attorney of a plurality of attorneys is identified as an author of at least one document of a plurality of documents, each document of the plurality of documents has a date associated therewith; applying a weight to the count based on the date of each document used to determine the count to yield a weighted count, a more recent date corresponds to a greater weight; determining a legal experience indicator for each attorney based on the weighted count; and ranking each attorney of the plurality of attorneys according to the legal experience indicator; providing a list of the plurality of attorneys according to the ranking.

Abstract: A system, method and computer program product for efficiently retrieving relevant passages to questions based on a corpus of data. A processor device receives an input query and performs a query analysis to obtain searchable query terms. The processor performs: matching metadata associated with one or more documents against the query terms. The document metadata includes one or more of: a title of the documents, one or more user tags or clouds. Then the processor device performs: mapping matched document metadata to corresponding one or more documents; identifying corresponding matched documents to form a subcorpus of documents; and conducting a search in the data subcorpus using the searchable query terms to obtain one or more passages relevant input query from the identified documents.

Abstract: A plurality of segments in an e-mail collection by parsing content of e-mails is generated. Corresponding segment signature for each segment is created and a signature index is populated using the generated segment signatures. After receiving a query e-mail, a plurality of query segments in the query e-mail is generated using content of the query e-mail and corresponding query segment signature for each query segment is generated. A query root segment is identified and corresponding query root segment signature is generated. A set of root segment signatures of the signature index is identified and the query root segment signature is compared with each root segment signature from the signature index. A subset of the signature index is identified, using a match between the root segment signature and the query root segment signature. An e-mail thread hierarchy is built using the identified subset of the signature index.

Abstract: A social media organizer for instructional or educational content may maintain one or more media clips relating to used-defined educational or instructional topics. In one implementation, a device may maintain user-created sets of media clips, where the media clips in a set of media clips include instructional media clips that relate to a particular subject. The device may further receive rankings from users relating to a quality of the sets of media clips and determine one or more of the sets of media clips that match a user search request. Additionally, the device may provide an interface that provides commands for the user to control playback of the media clips.

Abstract: This invention is related to an object sharing and search system (OS3) that allows users to create and share computational content of any sort in a multi-user computing environment. It considers user, domain and document as three basic and interacting classes of objects, and allows users to create domain hierarchies, to create objects within a domain, to specify the accessibility of an object in a domain, etc., and it controls the access of an object by another object in a domain. It also allows users to search objects in a domain and recommend the ranking for a search.

Abstract: A method and system for performing a semantic search on structured data. An unstructured search query is received from a requestor. The query is evaluated within a computer to identify a best structured request based on the unstructured search query. The selected structured request is applied to a set of structured data. The result of the application of the structured request is then returned to the requestor.

Abstract: At least one quasi-identifier attribute of a plurality of ranked attributes is selected for use in anonymizing a database. Each of the ranked attributes is ranked according to that attribute's effect on a database-centric application (DCA) being tested. In an embodiment, the selected quasi-identifier attribute(s) has the least effect on the DCA. The database is anonymized based on the selected quasi-identifier attribute(s) to provide a partially-anonymized database, which may then be provided to a testing entity for use in testing the DCA. In an embodiment, during execution of the DCA, instances of database queries are captured and analyzed to identify a plurality of attributes from the database and, for each such attribute identified, the effect of the attribute on the DCA is quantified. In this manner, databases can be selectively anonymized in order to balance the requirements of data privacy against the utility of the data for testing purposes.

Abstract: Computer method and apparatus manages and navigates computer implemented information. A first source information and second source information are related as parent-child information. Keywords are extracted from the first and second source information and are used to relate second source information to the first source information. This produces dynamic sets or groupings of second source information related by keywords. Display of a listing of the keywords enables user navigation of the information especially according to the groupings of second source information.

Abstract: A method and apparatus for detecting pre-selected data stored on a personal computing device is described. In one embodiment, contents of data storage media of a personal computing device are searched for pre-selected sensitive data. In one embodiment, if at least a portion of the pre-selected sensitive data is detected, a notification of the detection of the pre-selected data is sent to a system via a network. In another embodiment, if at least a portion of pre-selected sensitive data is detected, the access to this data is blocked.

Abstract: A method and apparatus to manage a database in which a data file and an index file are efficiently disposed include generating a table space in such a way that a region of a database in which data in a table form is stored is allocated to a first storage device, and a region of the database in which index information used to search for the data is stored is allocated to a second storage device, storing the data in table form in the first storage device and the index information in the second storage device according to the table space, and storing the data in the database or searching the database according to an input query.

Abstract: In conventional retrieval techniques for narrowing down a candidate when there are a plurality of candidates as retrieval results, a method results in a huge number of candidates in order to prevent omission of candidates, whereby the administration cost is increased, and another method involves always processing all candidates, whereby the processing time becomes longer and the response performance is lowered.

Abstract: An approach is provided for enabling dynamic user based search within a distributed information space. A request for conducting a search over one or more information spaces is distributed to one or more autonomous agents. The autonomous agents process the request according to one or more functions specific to the one or more autonomous agents. Results are rendered to an interface of a user device in response to the search request.

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: Disclosed are a method for searching information based on user's intention and a method for providing information. The method for searching information provides an editor meeting searcher's intention detected using analysis results for keywords and searches contents having metadata associated with metadata input through the editor. As a result, a search may be formed by detecting searcher's intention from information input by a searcher, inducing a detailed metadata input based on the detected intention, and using the input metadata.

Abstract: Embodiments of the disclosed innovations provide systems and methods for locating data associated with rendered documents. Some embodiments support the use of a handheld document data capture device.

Abstract: Methods and systems supporting curation of items in a searchable knowledge base are provided. The methods and systems include mining one or more search queries of the searchable knowledge base, where each of the search queries includes a plurality of the items. The method further includes determining one or more pairs of items using a processor, where each of the pairs of items includes a correlation value exceeding a threshold. The correlation values for the pairs of items are based upon the frequency the items of the pairs of items co-occur within the search queries. The method further includes providing the pairs of items to a curator, where the curator reviews the pairs of items.

Abstract: Information may be presented to a user by receiving a selection of one or more terms passively displayed in a document, loading the terms to a search configuration, generating first results responsive to a user's predicted interest as expressed in the search configuration, and enabling display of the first results.

Abstract: In one embodiment, a method for integrating a service into an application is provided. The method determines an application extensibility description for an application. The application extensibility description includes a set of application extension points. The method determines a service description for a service, the service description including a set of service elements. An adaptation pattern is determined and includes a first port connected to an application extension point in the set of application extension points and a second port connected to a service element in the set of service elements. A computing device generates an integration description based on the adaptation pattern having the first port connected to the application extension point and the second port connected to the service element. The integration description allows the application to be adapted or extended with the service.

Abstract: Middleware is integrated within a database engine. The middleware is to execute a functional-form query representing a dataflow graph comprising queries and relation valued functions. The middleware is to interact with the database engine to cause the database engine to execute the queries. Each relation valued function receives a plurality of first relations as input and generates a second relation as output.

Abstract: A hybrid database can receive a hybrid query for an object having a real world analog. A feature of a set of feature records can be determined that corresponds to the object. Feature-level attribute values of the feature can be extracted from the feature records. A volumetric envelope forming an outer boundary of the feature in a volumetric storage space of the hybrid database can be determined. A set of uniquely indexed voxels can be determined. Each voxel can be a volumetric unit of the volumetric storage space that represent the volume contained by the volumetric envelope. Voxel-level semantic values can be extracted from the set of uniquely indexed voxels from voxel records. Extracted voxel-level semantic values and extracted feature-level attribute values can be combined to generate a hybrid result. The hybrid result can be conveyed to a requestor from which the hybrid query was received.

Abstract: Methods for managing, and utilizing connections between an application server and an enterprise information system (EIS) based on a Daytona architecture are provided. The methods may include operating a resource adapter conforming to the JCA standard, and interfacing with and being managed by the application server. The resource adapter may be configured to provide a connection to the EIS and to submit a query request to and receive query results from the EIS, including receiving the query request from a client; instructing the EIS to open a query, compile the query, execute the query, and return the results of the execution of the query; receiving the results of the execution of the query from the EIS; instructing the EIS to terminate the connection; and returning the results of the execution of the query to the client. Related systems and computer program products are also provided.