Abstract: A computer-implemented graphical apparatus and method for navigating a collection of data such as a database by exploring or drilling down through a database without needing to enter a text-based keyword search; and navigating a database using a graphical interface that presents structured options to users rather than relying on user knowledge to direct the navigation process.

Abstract: A method of detecting a reference sequence of events in a sample sequence of events, wherein each event is of a certain event type and holds a set of data attributes, includes the steps of: picking candidate combinations of events from said sample sequence so that the event types within each candidate combination match the event types in the reference sequence, calculating an overall similarity score for each candidate combination from at least (i) an event occurrence score based on occurrence deviations representing a count of non-matching events between the events of a candidate combination matching events of the reference sequence and (ii) an attribute match score based on similarity deviations between the data attributes of the events of a candidate combination and the data attributes of the matching events of the reference sequence, and identifying the candidate combination with the best overall similarity score as reference sequence detected.

Abstract: An adaptive query throttling system and method are provided herein.

Abstract: An apparatus comprises data storage coupled to one or more processors and a plurality of data elements contained in a database structure and organized in a hierarchical data tree, and instructions that perform receiving a network location identifier from a client computer, wherein the network location identifier comprises at least a portion that specifies a first view of the data tree; creating, using the portion of the network location identifier, a relational database query and submitting the query to a relational database; receiving from the relational database a set of data elements that is associated with the first view; generating a first electronic document comprising the set of data elements, including generating transformative links to other network location identifiers corresponding to performing actions on nodes in the data tree; and providing the first electronic document to the client computer.

Abstract: The present invention provides an information retrieving apparatus and the like which replies a search result accurately to a question from the user. In the present invention, sentence information of a sentence in collected documents is stored, information of a questioning sentence from the user is received from a terminal 2, the questioning sentence from the user is decomposed into segments (S10), documents having common arc segments are extracted from segments in the questioning sentence from the user, the documents are compared with the questioning sentence, and a leaf segment missing in the questioning sentence is retrieved (S12 to S16), and the search result is transmitted to the terminal 2 (S19).

Abstract: Systems and methods for the management of contact information, which may include automatic transfer processes (102,103), automatic update processes, automatic customization processes, automatic delivery processes (1061,1062,1063), automatic storage processes (101), automatic portability processes (106), and/or automatic radial mining processes.

Abstract: Extracting and synchronizing an Enterprise Portal application resource types and properties of business objects located in repository is disclosed. The repository is queried without human intervention to determine business object type information and for each business object type its associated properties. A representation of the business object types and associated properties in a format that facilitates synchronization with the enterprise portal application is generated.

Abstract: An approach is provided to partition inter-linked documents into partitions of a database system. In some embodiments, a plurality of documents may be assigned to two or more partitions in the database system, thereby forming a number of inter-partition links between a first partition and a second partition. Here both the first partition and the second partition are in the two or more partitions. First documents may be assigned to the first partition while second documents are assigned to the second partition. Both the first documents and the second documents are in the plurality of documents. It is then determined whether moving one or more of the first documents in the first partition to the second partition reduces the number of inter-partition links between the first partition and the second partition. If that is the case, the one or more of the first documents are moved to the second partition.

Abstract: Systems, methods, and computer storage media having computer-executable instructions embodied thereon that facilitate providing suggested sites in accordance with target sites are provided. Web-browsed data is locally stored on a user device and uploaded to a suggestion engine. Additional web-browsed data is communicated to the suggestion engine via a suggested site request that provides a request for suggested sites related to a target site. In embodiments, the web-browsed data contained in the suggested site request includes data not previously uploaded to the suggestion engine. The suggestion engine utilizes the web-browsed data uploaded to the suggestion engine and the web-browsed data communicated via the suggested site request to provide suggested sites in association with the target site.

Abstract: Embodiments of the present invention allow verification of query language by providing a natural language description for the query language. A natural language description is generated for each query component along with selectable text representing the query component. Upon selection of the selectable text, the query component is rendered for editing.

Abstract: Embodiments of the invention provide techniques for selecting rule engines for processing abstract rules based on functionality and cost. In general, an abstract rule is analyzed to determine which functions are required to process the rule. The abstract rule is assigned to a rule engine by evaluating metadata describing the functions and costs of the rule engines. The abstract rule is then translated to the format required by the selected rule engine.

Abstract: A method of detecting a reference sequence of events in a sample sequence of events, wherein each event is of a certain event type and holds a set of data attributes, includes the steps of: picking candidate combinations of events from said sample sequence so that the event types within each candidate combination match the event types in the reference sequence, calculating an overall similarity score for each candidate combination from at least (i) an event occurrence score based on occurrence deviations of the events of a candidate combination with respect to the matching events of the reference sequence and (ii) an attribute match score based on similarity deviations between the data attributes of the events of a candidate combination and the data attributes of the matching events of the reference sequence, and identifying the candidate combination with the best overall similarity score as reference sequence detected.

Abstract: An automatic account organization tool is provided to organize a large adgroup into smaller adgroups with semantically meaningful names. For example, a set of input keywords is received, semantically related pairs of keywords are identified from the set of input keywords, and hierarchical clustering is applied to the pairs of keywords to identify a set of clusters of keywords, each cluster having semantically related keywords. A name can be determined for each of the clusters.

Abstract: An information retrieval system uses phrases to index, retrieve, organize and describe documents. Phrases are extracted from the document collection. Documents are the indexed according to their included phrases, using phrase posting lists. The phrase posting lists are stored in an cluster of index servers. The phrase posting lists can be tiered into groups, and sharded into partitions. Phrases in a query are identified based on possible phrasifications. A query schedule based on the phrases is created from the phrases, and then optimized to reduce query processing and communication costs. The execution of the query schedule is managed to further reduce or eliminate query processing operations at various ones of the index servers.

Abstract: An information retrieval system uses phrases to index, retrieve, organize and describe documents. Phrases are extracted from the document collection. Documents are the indexed according to their included phrases, using phrase posting lists. The phrase posting lists are stored in an cluster of index servers. The phrase posting lists can be tiered into groups, and sharded into partitions. Phrases in a query are identified based on possible phrasifications. A query schedule based on the phrases is created from the phrases, and then optimized to reduce query processing and communication costs. The execution of the query schedule is managed to further reduce or eliminate query processing operations at various ones of the index servers.

Abstract: A service recommendation system and a service recommendation method capable of improving the probability of the estimation of a user task and recommending a service depending on a user task can be provided. The user role obtaining unit 210 of the service recommendation server 100 obtains the role of a user, and the task estimating unit 207 estimates a user task from a task model associated with the obtained user role and stored in the task knowledge DB 103. The service knowledge retrieving unit 208 retrieves a service capable of assisting a user task obtained from the task estimating unit 207.

Abstract: Systems and methods for dynamic display of revision indicia are disclosed. In one embodiment, a method for dynamic display of revision indicia in an information product generated by a publishing system includes determining that at least one element of a structured content has been revised; adding a time-stamp metadata to each element of the structured content; and rendering the structured content for publication, wherein rendering includes comparing the time-stamp metadata of each element with a baseline date; and if the time-stamp metadata indicates that a particular element has been revised subsequent to the baseline date, displaying a revision indicia at least proximate to each element in the information product.

Abstract: A method, apparatus and program product to optimize a database query. A query plan is generated for the database query where the query plan includes first and second subplans. Cached optimization data associated with the first subplan and generated during evaluation of another query plan for a previous query that uses the first subplan is retrieved. The first subplan is evaluated for resource cost using the retrieved optimization data. The second subplan is also evaluated for resource cost. The query plan is then evaluated for resource cost based upon the evaluations of resource cost for the first and second subplans. A query plan is selected based on evaluations of resource cost and the plan is executed to generate a result set.

Abstract: Mechanisms of memory management in a scoped memory system of a data processing system having a one or more scoped memory areas are provided. The mechanisms identify a set of one or more child scoped memory areas of the scoped memory area for garbage collection. The mechanisms further identify, in each scoped memory area of the set, references to the scoped memory area for garbage collection as root references for objects allocated in the scoped memory area of the scoped memory system, thereby generating a set of root references. The mechanisms also recursively traversing and marking objects that are referenced from the set of root references and that are allocated in the scoped memory area of the scoped memory system and identify objects in the scoped memory area of the scoped memory system that are not so marked. The identified objects are discarded from the scoped memory system.

Abstract: A system is described for targeting data to a site referenced on a page based on a condition. The system may include a processor, a memory, and an interface. The memory may be operatively connected to the processor and the interface and may store a data, a site, a condition, and a page containing content. The interface may be operatively connected to the memory and the processor and may communicate the page to a user. The processor may identify the data, site, condition, and page containing content. The processor may add the data to the page if the content of the page satisfies the condition.