26th week of 2012 patent applcation highlights part 68 |
Patent application number | Title | Published |
20120166396 | METHOD AND APPARATUS FOR DATA RECOVERY USING STORAGE BASED JOURNALING - A storage system maintains a journal and a snapshot of one or more data volumes. Two journal entry types are maintained, an AFTER journal entry and a BEFORE journal entry. Two modes of data recovery are provided: “fast” recovery and “undo-able” recovery. A combination of both recovery modes allows the user to quickly recover a targeted data state. | 2012-06-28 |
20120166397 | DEVICE AND METHOD FOR MANAGING ENVIRONMENT OF SYSTEM - A method in which a system environment management device manages user environment information, the method includes: connecting to a first user terminal; searching for and reading personal information and environment setting information of the first user terminal; analyzing the personal information and environment setting information; determining whether the analyzed personal information and environment setting information is a common element; and storing, if the analyzed personal information and environment setting information is a common element, the analyzed personal information and environment setting information in a common profile storage unit of the system environment management device. | 2012-06-28 |
20120166398 | Asynchronous Data Processing - A method, a system, and computer-readable medium for processing of data are disclosed. An acknowledgement is received to store business object data. Based on the acknowledgement, an indication that the business object data is stored in a repository is generated. Processing of the business object data to enable storage in the repository continues while generating such indication. | 2012-06-28 |
20120166399 | AUTOMATED ROLE CLEAN-UP - Various embodiments of systems and method automated role clean-up are described herein. In various embodiments, an automated role clean-up agent can connect to a role repository system that may be configured to implement an automated role clean-up workflow. A method of an embodiment ensures that roles that are not being used or outdated are safe to delete. One or more deletion buffers may be configured to determine whether roles need to be deleted from the role repository system. Assigning conditions to a deletion buffer lets roles to be incubated in these deletion buffers for a desired period of time before deletion if the conditions are met. A re-affirmation can be sent out to role owners for deletion approval before roles are deleted. Deletion of the roles is performed by the role repository system. | 2012-06-28 |
20120166400 | TECHNIQUES FOR PROCESSING OPERATIONS ON COLUMN PARTITIONS IN A DATABASE - Techniques for processing operations on column partitions of a table in a database are provided. A table includes a control column partition. Each delete container of the control column partition representing multiple rows in the table (or a row partition, if any), and each row represented by a bit flag within a bit string. Rows of the table set for deletion have their corresponding bits within a particular delete container set to indicate those rows are deleted. | 2012-06-28 |
20120166401 | Using Index Partitioning and Reconciliation for Data Deduplication - The subject disclosure is directed towards a data deduplication technology in which a hash index service's index is partitioned into subspace indexes, with less than the entire hash index service's index cached to save memory. The subspace index is accessed to determine whether a data chunk already exists or needs to be indexed and stored. The index may be divided into subspaces based on criteria associated with the data to index, such as file type, data type, time of last usage, and so on. Also described is subspace reconciliation, in which duplicate entries in subspaces are detected so as to remove entries and chunks from the deduplication system. Subspace reconciliation may be performed at off-peak time, when more system resources are available, and may be interrupted if resources are needed. Subspaces to reconcile may be based on similarity, including via similarity of signatures that each compactly represents the subspace's hashes. | 2012-06-28 |
20120166402 | TECHNIQUES FOR EXTENDING HORIZONTAL PARTITIONING TO COLUMN PARTITIONING - Techniques for extending horizontal partitioning to column partitioning are provided. A database table is partitioned into custom groups of rows and custom groups of columns. Each partitioned column is managed as a series of containers representing all values appearing under the partitioned column. A logical row represents a row of the table logically indicating each column value of a row. Compression, deletion, and insertion within the containers are managed via a control header maintained with each container. | 2012-06-28 |
20120166403 | DISTRIBUTED STORAGE SYSTEM HAVING CONTENT-BASED DEDUPLICATION FUNCTION AND OBJECT STORING METHOD - Distributed storage system having content-based deduplication function and object storing method. The distributed storage system may include a plurality of data nodes and a server coupled with the plurality of data nodes. Each one of the plurality of data nodes may be configured to store at least one object. The server may be configured to perform a deduplication function based on a content-specific index of a target object and content-specific indexes of objects stored in the plurality of data nodes in response to an object storage request from a client, and configured to store the target object in one of the plurality of data nodes based on a result of the deduplication function performed by the server. | 2012-06-28 |
20120166404 | REAL-TIME TEXT INDEXING - Systems, methods, and other embodiments associated with real-time text indexing are described. One example method includes receiving a document for indexing in a search system that includes a mature index and indexing the received document in a staging index. The staging index may be stored in direct access memory associated with query processing that does not degrade query performance even when postings become fragmented. The staging index and the mature text index are accessed to process queries on the search system. The example method may also include periodically merging the staging index into the mature index based on query feedback. | 2012-06-28 |
20120166405 | Changeability And Transport Release Check Framework - Disclosed are methods, systems and products, including a method that includes receiving an object including an identifier to determine whether the object is subject to at least one of a change during a transaction and a transport from a first system to a second system; determining attributes for the received object; determining a rule based on at least the identifier and the determined attributes; and allowing an action comprising at least one of the change to the object and the transport of the object based on a result of a rule check performed using the determined rule. Related systems, methods, and articles of manufacture are also disclosed. | 2012-06-28 |
20120166406 | Information Integrity Rules Framework - An information integrity rules framework manages rules across heterogeneous enforcement systems by managing canonical rules that are mapped to native rules and enforcement system-specific rules. The information integrity rules framework discovers an existing native rule utilized by an enforcement system, which is written in an enforcement system-specific format. Next, the information integrity rules framework creates a mapping entry and maps the native rule to a canonical rule, which is independent from the enforcement system. When the information integrity rules framework detects a change to one of the rules managed by the framework, the information integrity rules framework propagates the change to other corresponding rules across enforcement systems managed by the framework. | 2012-06-28 |
20120166407 | Distributed Transaction Management Using Two-Phase Commit Optimization - A computer-implemented method, a computer-readable medium and a system are provided. A transaction master for each of a plurality of transactions of a database is provided. Each transaction master is configured to communicate with at least one transaction slave to manage execution of a transaction in the plurality of transactions. Each transaction master configured to perform generating a transaction token to specify data to be visible for a transaction on the database, the transaction token including a transaction identifier for identifying whether the transaction is a committed transaction or an uncommitted transaction, receiving a request to commit the transaction, initiating, based on the request, a two-phase commit operation to commit the transaction. The two-phase commit operation includes preparing for committing the transaction, writing a committed transaction to a memory, optimizing the two-phase commit operation by omitting a phase of the two-phase commit operation, generating an acknowledgement of the committed transaction. The plurality of transactions of the database are executed with each transaction master. | 2012-06-28 |
20120166408 | Aspected Interfaces and Methods for Synchronized Containers and Other Data Structures - The subject disclosure is directed towards an object (e.g., an aspected vector, queue, map, stack and so forth) container having an exclusive interface, a shared-read-only interface and a shared-write (and read) interface to a common set of data. Use cases during runtime determine the appropriate interface to use. No locking is needed with methods of the exclusive interface or the read-only interface. The shared-write interface is configured to have only concurrency safe methods. Also described is blocking the use of other interfaces while one interface is in use, and the use of reference counter tracking to know when no concurrent readers and/or writers remain, to allow transitioning to use a different interface. | 2012-06-28 |
20120166409 | SYSTEM AND A METHOD FOR GENERATING CHALLENGES DYNAMICALLY FOR ASSURANCE OF HUMAN INTERACTION - The invention provides a method, a system, and a computer program product checking for human interaction dynamically to enable access to a resource in a computing environment. The method comprises collecting a plurality of objects. For each object, a plurality of properties is defined. A set of objects is selected from the plurality of collected objects. Thereafter, queries are generated based on the properties of the selected objects. Queries which have a non-unique or ambiguous response are removed. One of the remaining queries is randomly selected. The answer to the query, based on properties of the selected objects, is stored. The selected set of objects and the selected query are presented to the user who is trying to gain access to the resource. The user is enabled access to the resource if the response received from the user is validated against the stored answer of the selected query. | 2012-06-28 |
20120166410 | APPARATUS AND METHOD FOR COMMUNICATING WITH A MIRROR CAMERA - The subject matter discloses a system for communicating between a customer at a retail store and a mirror point used to generate media files at the retail store using a capture device, the system comprises a storage for storing contact information of the customer; a processor for enabling access of a customer's device to the mirror point; a communication module for transmitting the media files generated by the mirror point at the retail store to the customer's desired destination using the contact information stored at the storage structure. | 2012-06-28 |
20120166411 | DISCOVERY OF REMOTELY EXECUTED APPLICATIONS - A search engine discovers and indexes applications in a search index and receives queries from devices. The search engine is configured to obtain contextual data describing context associated with the devices and/or social networking data associated with one or more users of the devices. Based upon the contextual data and/or the social networking data, the search engine modifies the query and executes the query to identify applications. The search engine generates search results corresponding to the identified applications. The search engine also is configured to generate advertising relevant to the modified query, and to rank the search results in accordance with the query, the contextual data, and/or the social networking data. The ranked search results and the advertising are presented to the client as search results and/or in a web store format. Activity of the client and the search engine can be tracked and reported to authorized entities. | 2012-06-28 |
20120166412 | SUPER-CLUSTERING FOR EFFICIENT INFORMATION EXTRACTION - A set of clusters associated with a plurality of web pages is received. A first data set and a second data set are generated by applying a first rule and the second rule, respectively, to web pages of a first cluster of the set of clusters. The second rule is substituted for the first rule responsive to having an acceptable extraction accuracy when applied to the first cluster. The extraction accuracy of the second rule is determined by comparing attributes of the second data set to attributes of the first data set. | 2012-06-28 |
20120166413 | Automatic Generation of Tasks For Search Engine Optimization - A method and a device for search engine optimization, that receives an identifier that identifies a domain, one or more keywords for analysis relative to a search engine, and search engine usage data, for each received keyword, gathering search engine results data, for at least one received keyword, mapping the at least one keyword to at least one web page within the identified domain, said mapping based on at least one of said search engine usage data and said search engine results data, and for at least one of the received keywords, generating at least one instruction to modify a web page element in a web page to which the at least one received keyword is mapped. | 2012-06-28 |
20120166414 | SYSTEMS AND METHODS FOR RELEVANCE SCORING - Systems and methods for relevance scoring are provided. Traditional scoring models use word frequency and placement to determine relevance. In contrast to these models, embodiments of the present invention provide cluster-based relevance scoring and tagging. Some embodiments use various cluster mappings and vector space models to generate relevance scores. In addition, the cluster mappings can be updated overtime to reflect a change in topic clustering. | 2012-06-28 |
20120166415 | SUPPLEMENTING SEARCH RESULTS WITH KEYWORDS DERIVED THEREFROM - Embodiments are provided for creating a personalized search index and supplementing searches with an additional set of keywords. A first set of keywords is received from a user. A first index associated with the user is searched using the first set of keywords to generate a first set of search results. The first index includes content identified by the user. A second set of keywords is defined based on the first set of search results. A second index is searched using the second set of keywords to generate a second set of search results. At least a portion of the first and second sets of search results is provided to the user. Some embodiments are implemented as a cloud computing service. | 2012-06-28 |
20120166416 | METHOD AND SYSTEM TO IDENTIFY GEOGRAPHICAL LOCATIONS ASSOCIATED WITH QUERIES RECEIVED AT A SEARCH ENGINE - Techniques are provided for prediction locations of users that submit search queries. A query is received at a search engine. An inverted index is searched to identify one or more geographical locations associated with one or more terms of the received query. The inverted index lists a plurality of query terms and one or more geographical locations associated with each query term. Each geographic location that is associated with a listed query term in the inverted index is a determined location for at least one user previously having submitted the listed term in a search query. A geographical location is predicted for a user that submitted the received query based on the identified one or more geographical locations. In this manner, a location is predicted for the user based on similar queries previously submitted by users. | 2012-06-28 |
20120166417 | ASYNCHRONOUS TRANSFER OF STATE INFORMATION BETWEEN CONTINUOUS QUERY PLANS - Described herein are technologies pertaining to migrating state information of operators in a first continuous query plan to a second continuous query plan in an asynchronous manner, such that the first continuous query plan need not cease executing during the migrating of the state information. State information pertaining to stateful operators, such as join operators, is migrated from the first continuous query plan to the second continuous query plan by way of a transformation plan. State matching is utilized to generate the transformation plan. | 2012-06-28 |
20120166418 | METHODS AND SYSTEMS FOR OPTIMIZING DATA ACCESSES - A method for optimizing data types includes the step of generating a data structure providing access to at least one data element, the data structure associated with a first representation of the at least one data element. A user is provided with a plurality of data types for accessing the at least one data element. A request for access to the at least one data element is received, the request including at least one of the plurality of data types. The request is responded to with a second representation of the at least one data element, the second representation generated responsive to the at least one of the plurality of data types. | 2012-06-28 |
20120166419 | METHOD, SYSTEM AND PROGRAM FOR CACHE CONTROL IN DATABASE - A system, a program product and an associated method is provided for data processing management in a computing environment having at least a processor. The method comprises creating in the memory an invalidation index having a plurality of rows, each row further comprising a search key field, an ID list field for IDs of records associated with the database, and a count value field. Every time a new reference query is received the processor searches for a row in said invalidation index with an already created search key and then decreases count value of a counter when a match is found and when a match is not found creating a new search key and a new row in an associated invalidation index for said new key. | 2012-06-28 |
20120166420 | SYSTEMS AND METHODS FOR CREATING SCALABLE PRESENCE SUBSCRIPTIONS IN FEDERATED PRESENCE ENVIRONMENTS - Systems and associated methods for providing scalable presence subscriptions in federated presence environments are described. Embodiments provide for intelligent addition of subscriptions to a presence system. Embodiments identify if a virtualized presentity (corresponding to a new query) can be composed from existing virtualized presentities, and if so, corresponding query processing cells (QPCs) (servicing existing queries) are reused to retrieve the presence information (partially or fully) for the new incoming query. Embodiments organize the existing QPCs into a hierarchy such that a QPC/virtual presentity at a higher layer fetches presence information of all or some presentities from QPCs/virtual presentities at lower layer(s) to service the new query. | 2012-06-28 |
20120166421 | SYSTEMS AND/OR METHODS FOR USER FEEDBACK DRIVEN DYNAMIC QUERY REWRITING IN COMPLEX EVENT PROCESSING ENVIRONMENTS - Certain example embodiments described herein relate to techniques for user feedback driven dynamic query rewriting in complex event processing (CEP) environments. In certain example embodiments, the adjustment of already-initiated queries may be permitted during runtime in order to help continuously or substantially continuously meet a user's requirements. In certain example embodiments, parameters of a query may be adapted dynamically, e.g., without the need to redeploy it. Adaptable parameters in certain example embodiments may be identified and/or based on, for instance, an automatic determination from original query creation, user specifications, the way in which a user interacts with a user interface for visualizing the results of queries, etc. | 2012-06-28 |
20120166422 | Generic Node Including Stored Script - Methods and apparatus, including computer program products, are provided for providing for processing calculation plans. In one aspect, there is provided a computer-implemented method. The method may include generating a calculation plan including a plurality of nodes; determining whether at least one of the nodes includes a function node; and compiling the function node into executable code to enable execution of the plurality of nodes including the function node at the database. Related apparatus, systems, methods, and articles are also described. | 2012-06-28 |
20120166423 | COLLECTION OF STATISTICS FOR SPATIAL COLUMNS OR R-TREE INDEXES - Techniques for collecting statistics of column data or R-Tree indexes are provided. A distributed database system includes a plurality of processing nodes controlling portions of spatial data. The nodes are instructed to create minimum bounding rectangles (MBR's) for their spatial data or R-Trees. The individual MBR's are merged and reformatted into a grid of equally sized cells. Each processing node is provided a copy of the grid to update based on statistics of each processing node's spatial data for a target table. The updated grids are then merged into a single grid and used by an optimizer to evaluate queries before the queries are executed. | 2012-06-28 |
20120166424 | Apparatus for Elastic Database Processing with Heterogeneous Data - A database management system implemented in a cloud computing environment. Operational nodes are assigned as groups of controller-nodes, compute-nodes or storage-nodes. Queries specify one or more tables for an associated database operation, with each table being assigned to respective storage nodegroup(s). The number of nodes executing a given query may change, by (a) changing the compute-nodes associated with a connection, or (b) adding or removing nodes associated with a connection; and/or distributing data to a storage nodegroup based on a Distribution Method which may be either data dependent or data independent. A controller node further executes a Dynamic Query Planner (DQP) process that develops a query plan. | 2012-06-28 |
20120166425 | Systems and Methods for Creating and Using a Research Map - Systems and methods create a graphical representation of a research map that allows performance of search functions using the nodes of the graphical representation. In one implementation, a system includes a processor and a memory. The memory stores instructions that cause the processor to receive a query for searching a document repository and run the query in the document repository. The processor stores the results of the query and the query as a root node in a research tree. The processor receives a filter for the results of the query. The processor stores the filter and the result list for the filter as a filter node connected to the root node of in the research tree. The processor receives a request to view a document from the result list for the filter and stores the request as a document node connected to the filter node. The processor then creates a display of a research map that includes the research tree. | 2012-06-28 |
20120166426 | EXTRACTING AND DISPLAYING COMPACT AND SORTED RESULTS FROM QUERIES OVER UNSTRUCTURED OR SEMI-STRUCTURED TEXT - A system for indexing unstructured or semi-structured data is disclosed. The system may identify regions within the data, such as “Abstract” or “References”. The system may identify linguistic units such as sentences, noun groups, verb groups. The system may also identify concepts such as companies, people, diseases, amounts, and so forth. The query results may be formatted so that similar results from different documents, or from the same document, are clustered together. | 2012-06-28 |
20120166427 | Query Authoring by Modifying a View of the Results of the Query - Technologies and concepts are described herein for authoring a database query through the modification of a view of the data to be returned by the query. A user interface is provided for authoring a database query through the modification of a view of the data to be returned by the query that includes a view showing the results of a database query. A user interface is also provided for modifying the view to define the results of the query. As the view is modified, a query definition is generated which, when executed against the database, will return the results of the database query shown in the view. When the desired results are shown in the view, the query definition can be saved and run against the database to perform the database query. | 2012-06-28 |
20120166428 | METHOD AND SYSTEM FOR IMPROVING QUALITY OF WEB CONTENT - A method of improving quality of web content. The method includes analyzing search logs associated with a plurality of web pages by a processor. The search logs are stored in an electronic storage device. A plurality of queries from the search logs are assembled into one or more query profiles. Concepts for the one or more query profiles are generated and classified into one or more concept profiles. Further, the one or more concept profiles are ranked based on one or more parameters. The one or more concept profiles are then transmitted to one or more mediums. | 2012-06-28 |
20120166429 | USING STATISTICAL LANGUAGE MODELS FOR CONTEXTUAL LOOKUP - Using a statistical language model to make information related to a word or other content of interest available is disclosed. An indication that a word or phrase is of interest is received. A contextual meta-information associated with the word or phrase of interest as used in context is used to make information related to the word or phrase of interest available, for example, by forming a more precise query and/or filtering search results based on the contextual meta-information. | 2012-06-28 |
20120166430 | Scalable Performance Management System - A performance management system leverages an iterative process to provide performance reports, with reduced computing resources. In response to a request for a performance report, a respective subset of performance data records may be received from each of a plurality of sources. It may then be determined whether additional performance data records are to be requested from the plurality of sources for the report. The received data may be processed and the resultant report may be outputted. For example, the iterative process may be applied to generate a top-n report based on network flow performance data in a computer information system. | 2012-06-28 |
20120166431 | AUGMENTATION OF PLACE RANKING USING 3D MODEL ACTIVITY IN AN AREA - Aspects of the invention relate generally to ranking geographic locations based on perceived user interest. More specifically, a database of three-dimensional models of buildings or other architectural features may be used to determine the level of user interest in a particular location and accordingly rank, for example, geographic locations or web or map search results with local intent. For example, various signals such as the number of models created by users for a particular location, the number of clicks or requests for the models of the particular location, the number of POIs contained within or associated with the models associated with the particular geographic location, number of categories associated with a model associated with the geographic location, number of embedded views or views of the models associated with the particular location on other web sites, and the age of the models associated with the particular geographic location. | 2012-06-28 |
20120166432 | Providing Context Relevant Search for a User Based on Location and Social Information - A social networking system provides relevant third-party content objects to users by matching user location, interests, and other social information with the content, location, and timing associated with the content objects. Content objects are provided based on relevance scores specific to a user. Relevance scores may be calculated based on the user's previous interactions with content object notifications, or based on interests that are common between the user and his or her connections in the social network. Context search is also provided for a user, wherein a list of search of results is ranked according to the relevance score of content object associated with the search results. Notifications may also be priced and distributed to users based on their relevance. In this way, the system can provide notifications that are relevant to user's interests and current circumstances, increasing the likelihood that they will find content objects of interest. | 2012-06-28 |
20120166433 | PROVIDING RELEVANT NOTIFICATIONS FOR A USER BASED ON LOCATION AND SOCIAL INFORMATION - A social networking system provides relevant third-party content objects to users by matching user location, interests, and other social information with the content, location, and timing associated with the content objects. Content objects are provided based on relevance scores specific to a user. Relevance scores may be calculated based on the user's previous interactions with content object notifications, or based on interests that are common between the user and his or her connections in the social network. Context search is also provided for a user, wherein a list of search of results is ranked according to the relevance score of content object associated with the search results. Notifications may also be priced and distributed to users based on their relevance. In this way, the system can provide notifications that are relevant to user's interests and current circumstances, increasing the likelihood that they will find content objects of interest. | 2012-06-28 |
20120166434 | CONTROL COMPUTER AND FILE SEARCH METHOD USING THE SAME - A method for performing file search using a control computer receives an initial query expression from a client computer, divides the initial query expression into one or more keywords, determines related terms corresponding to each keyword, merges the keywords and the related terms to obtain an updated query expression, and generates search results according to the updated query expression. The method further calculates relevance scores among a plurality of documents in the search results and the updated query expression, ranks the documents in the search results according to the relevance scores, and displays the documents in the search results with the ranked order. | 2012-06-28 |
20120166435 | DYNAMIC PRESENTATION OF TARGETED INFORMATION IN A MIXED MEDIA REALITY RECOGNITION SYSTEM - A context-aware targeted information delivery system comprises a mobile device, an MMR matching unit, a plurality of databases for user profiles, user context and advertising information, a plurality of comparison engines and a plurality of weight adjusters. The mobile device is coupled to deliver an image patch to the MMR matching unit which in turn performs recognition to produce recognize text. The recognized text is provided to a first and second comparison engines to produce relevant topics and relevant ads. The relevant topics and relevant ads are adjusted with information from a user context database including information such as location, date, time, and other information from a user profile. The third comparison engine compares the relevant topics and relevant ads to produce a set of final ads that are most related to the topics of interest for the user and delivered for display on to the mobile device. | 2012-06-28 |
20120166436 | METHOD AND SYSTEM FOR GENERATING PLAYLISTS FOR CONTENT ITEMS - A method and system for generating playlists for content items is provided. Generating a playlist involves monitoring user interaction with one or more content items as user-content interactions, determining a context associated with one or more user-content interactions, and generating a playlist of the content items based on the user-content interactions and the associated context. | 2012-06-28 |
20120166437 | Generating Maps of Private Spaces Using Mobile Computing Device Sensors - Digital maps of private spaces may be implemented using mobile computing device sensors. Sensor data may be received from one or more mobile computing devices to determine a digital signature describing a private space. Scheduling data may also be received from the one or more mobile devices. The scheduling data may describe a location associated with the private space to be mapped. A digital map of the private space may then be generated from the digital signature and the location associated with the private space in the scheduling data. | 2012-06-28 |
20120166438 | SYSTEM AND METHOD FOR RECOMMENDING QUERIES RELATED TO TRENDING TOPICS BASED ON A RECEIVED QUERY - Systems and methods for identifying candidate queries related to a trending topic based on a user query are described. A trending topic identification module identifies topics trending in one or more real-time content sources. The real-time content source(s) may include, for example, a source of microblog posts or other user-generated data, a news feed, or the like. A query recommendation module suggests at least one candidate query in response to receiving a user query. The query recommendation module obtains the at least one candidate query by comparing words and named entities of the user query with words and named entities associated with the trending topics identified by the trending topic identification module. | 2012-06-28 |
20120166439 | METHOD AND SYSTEM FOR CLASSIFYING WEB SITES USING QUERY-BASED WEB SITE MODELS - Web sites are grouped by generating feature space representations of documents, and aggregating the feature space representations into web site vectors. A document vector may be generated for each document of a plurality of documents associated with a set of web sites according to a query-based feature space model. The query-based feature space model defines features of the documents. Each document vector includes weights determined for features associated with the corresponding document. A web site vector is generated for each of the web sites using the plurality of document vectors. The web sites are grouped according to the web site vectors. | 2012-06-28 |
20120166440 | SYSTEM AND METHOD FOR PARALLEL SEARCHING OF A DOCUMENT STREAM - A system and method for searching a document for a query pattern. A plurality of streams may be stored each including a linear sequence of nodes. Each stream may be associated with nodes having a common label in a data tree of the document. A query pattern may be searched for in the streams by executing a plurality of threads. Each of two or more of the threads may be used to search different sub-streams of the plurality of streams. Each of the different sub-streams searched for by each thread in each stream may be uniquely correlated with one or more disjoint sub-trees of a partition of the tree into a plurality of sub-trees. The two or more of the plurality of threads may be executed in parallel. A result of the query pattern search may be generated using at least one of the threads. | 2012-06-28 |
20120166441 | KEYWORDS EXTRACTION AND ENRICHMENT VIA CATEGORIZATION SYSTEMS - Techniques for determining a set of keywords associated with a document are provided. A document is received that may be classified into a taxonomy that includes a plurality of categories. A categorization ranking is determined for each category for the received document. A set of categories of the taxonomy having highest categorization rankings is determined for the received document. Documents representing the set of categories having highest categorization rankings are combined together into a cumulative representative text that includes a plurality of terms. A cumulative term corpus importance score is determined for each term in the cumulative representative text. The cumulative term corpus importance score for a particular term indicates an importance of the particular term in a context of the cumulative representative text. A set of terms of the cumulative representative text having highest cumulative term corpus importance scores is selected to be keywords for the received document. | 2012-06-28 |
20120166442 | CATEGORIZING DATA TO PERFORM ACCESS CONTROL - Systems and methods categorize data to perform access control. A system receives first data, where the first data comprises at least a portion of data to be categorized. The system analyzes the first data to determine Whether the first data belongs to a first category. If the first data belongs to a first category, the system applies a first access control set to actions on the data to be categorized. Further, if one or more of the actions on the data to be categorized has an access control status of pending after applying the first access control set, the system receives second data, where the second data comprises at least a portion of data to be categorized. The system analyzes the second data to determine whether the second data belongs to a second category. If the second data belongs to a second category, the system applies a second access control set to at least one of the actions having the access control status of pending. | 2012-06-28 |
20120166443 | EASILY QUERIABLE SOFTWARE REPOSITORIES - Tables are created in such a way that allows rich querying using standard database routines and other tools. Developers and repository users are provided with a set of schema guidelines that describe how the software related items are to be categorized in the tables and how to use such tables for rich querying. For example, one such guideline provides for course-grained versioning of items (e.g., artifacts, metadata, etc.)—as opposed to the fine grained object principle of unit change found in most repository systems such as the entity-property-value scheme. The developers or providers then use these guidelines to optimally categorize, in a natural way, their metadata and other software related items for storing copies thereof in the repository. | 2012-06-28 |
20120166444 | CO-MAP COMMUNICATION OPERATOR - A high level programming language provides a co-map communication operator that maps an input indexable type to an output indexable type according to a function. The function maps an index space corresponding to the output indexable type to an index space corresponding to the input indexable type. By doing so, the co-map communication operator lifts a function on an index space to a function on an indexable type to allow composability with other communication operators. | 2012-06-28 |
20120166445 | METHOD, APPARATUS AND COMPUTER READABLE MEDIUM FOR INDEXING ADVERTISEMENTS TO COMBINE RELEVANCE WITH CONSUMER CLICK FEEDBACK - A method and apparatus are provided for better web ad matching by combining relevance with consumer click feedback. In one example, the method includes receiving a query page, extracting features from the query page, re-weighting the query page, evaluating the query page in light of each ad in order to score each ad and pick substantially best ad matches of the indexed ads, and returning the substantially best ad matches to the consumer computer. | 2012-06-28 |
20120166446 | INDEXING SPATIAL DATA WITH A QUADTREE INDEX HAVING COST-BASED QUERY DECOMPOSITION - Approaches for indexing and retrieving spatial data with a quadtree index in database management systems are described. In an embodiment, data objects are stored without decomposition within a linearized quadtree stored within a B-tree index. In another embodiment, a method determines an optimal execution plan for a spatial query by parsing it to determine a query type and geometry object associated with the query. The method tessellates the query object by recursively decomposing the quadtree blocks that cover it. Cost-based decomposition decisions are made by consulting a cost model furnished by the database management system to minimize the cost of the resulting index range plan on the B-tree storage. Thus, data-directed query decomposition enacted by the method results in the optimal cost index range plan for the current data distribution and system context. In another embodiment, a system identifies and displays an optimal index range plan in a user interface. | 2012-06-28 |
20120166447 | FILTERING QUERIED DATA ON DATA STORES - A data set may be distributed over many data stores, and a query may be distributively evaluated by several data stores with the results combined to form a query result (e.g., utilizing a MapReduce framework). However, such architectures may violate security principles by performing sophisticated processing, including the execution of arbitrary code, on the same machines that store the data. Instead of processing queries, a data store may be configured only to receive requests specifying one or more filtering criteria, and to provide the data items satisfying the filtering criteria. A compute node may apply a query by generating a request including one o more filter criteria, providing the request to a data node, and applying the remainder of the query (including sophisticated processing, and potentially the execution of arbitrary code) to the data items provided by the data node, thereby improving the security and efficiency of query processing. | 2012-06-28 |
20120166448 | Adaptive Index for Data Deduplication - The subject disclosure is directed towards a data deduplication technology in which a hash index service's index and/or indexing operations are adaptable to balance deduplication performance savings, throughput and resource consumption. The indexing service may employ hierarchical chunking using different levels of granularity corresponding to chunk size, a sampled compact index table that contains compact signatures for less than all of the hash index's (or subspace's) hash values, and/or selective subspace indexing based on similarity of a subspace's data to another subspace's data and/or to incoming data chunks. | 2012-06-28 |
20120166449 | METHOD AND SYSTEM FOR MANAGING SPORTS RELATED INFORMATION - A system and method for managing sports related information in real-time are provided. The system comprises a user interface module configured to receive data pertaining to one or more sports and sports related persons; a repository module configured to store the collected data; and a sports module configured to process the collected data to generate sports related information using predetermined algorithms, the generated information being stored in the repository module and being accessible via the user interface module. The sports module comprises a registration module configured to register one or more users; a validation module configured to validate information pertaining to users; a player information module configured to provide player information to users; a recommendation module configured to generate recommendations related to one or more players, teams or coaches; and a selection module configured to facilitate selection of at least one of players, teams and coaches. | 2012-06-28 |
20120166450 | SEARCH SYSTEM AND SEARCH METHOD FOR RECOMMENDING REDUCED QUERY - A search system includes a non-transitory computer-readable storage device, and a computing device. A term extracting unit causes the computing device to extract multiple terms from an input query, a weight computing unit causes the computing device to compute a weight for each of the multiple terms, and a reduction query recommending unit causes the computing device to remove at least one term from the multiple terms, based on the weight, and to provide at least one reduced query using remaining terms. A search method that uses a computing device to provide a reduced query, the method includes extracting multiple terms from an input query; computing, by the computing device, a weight of each of the multiple terms; and removing at least one term from the multiple terms, based on the weight, and providing at least one reduced query generated using remaining terms out of the multiple terms. | 2012-06-28 |
20120166451 | Use of Associate Memory Learning Agent Technology to Identify Interchangeable Parts in Parts Catalogs - The present invention provides a computer implemented method, apparatus, and computer usable program code for identifying interchangeable parts in parts catalogs. In one illustrative embodiment, a set of catalogs is searched for first attributes for a set of parts using an intelligent agent. The intelligent agent compares the first attributes for the set of parts to a set of second attributes for a selected part. A weight is assigned to each of the first attributes based on whether each of the first attributes is correlated to an attribute in the set of second attributes. Each part in the set of parts is ranked using the weight assigned to each attribute in the first attributes. A set of interchangeable parts is identified using the ranking for each part in the set of parts. | 2012-06-28 |
20120166452 | PROVIDING RELEVANT NOTIFICATIONS BASED ON COMMON INTERESTS BETWEEN FRIENDS IN A SOCIAL NETWORKING SYSTEM - A social networking system provides relevant third-party content objects to users by matching user location, interests, and other social information with the content, location, and timing associated with the content objects. Content objects are provided based on relevance scores specific to a user. Relevance scores may be calculated based on the user's previous interactions with content object notifications, or based on interests that are common between the user and his or her connections in the social network. Context search is also provided for a user, wherein a list of search of results is ranked according to the relevance score of content object associated with the search results. Notifications may also be priced and distributed to users based on their relevance. In this way, the system can provide notifications that are relevant to user's interests and current circumstances, increasing the likelihood that they will find content objects of interest. | 2012-06-28 |
20120166453 | SYSTEM AND METHOD FOR SOCIAL FILTERING OF COMMENTS - A request is received, over a network from a requesting user to sort a plurality of comments relating to online content by a social status of a respective one of a plurality of commenters associated with each of the plurality of comments. The social status of the each of the plurality of commenters is determined using a computing device. The plurality of comments are sorted, using the computing device, by the social status of the respective one of the plurality of commenters associated with each of the plurality of comments. A representation of the sorted comments is transmitted, over the network, to the requesting user. The social status of commenters can reflect, in various embodiments, the status of commenters as favorite commenters of the requesting user, as members of the requesting user's social network, or as a top rated commenters in an online community. | 2012-06-28 |
20120166454 | Generating a Hierarchy-Based Trace Log - A computer-implemented method for generating a hierarchy-based trace log includes: receiving a log generated by a trace program performed in a computer system, the log having entries organized by sequence number, each entry including an object key for an object involved in the traced event and a log message about the traced event; identifying all object keys that occur in the log; assigning different separation values to each of the entries; generating respective adjusted sequence numbers for all of the entries by combining each entry's sequence number with the separation value for that entry; and storing an adjusted log having entries organized by the adjusted sequence numbers. | 2012-06-28 |
20120166455 | Filter Range Bound Paged Search - A filter range based search control to request a range of data from one or more directory servers. A directory server receives a search request from a client application comprising a search filter control defining a set of requested data, a sort control defining a sorting order of the set of requested data, and a range filter control defining a range of entries in the requested data. Data entries matching a search value defined in the search filter control and sorted according to sort attributes defined in the sort control are obtained from a set of directories associated with the directory server to form a sorted list of matching entries. A subset of data entries in the sorted list that match a range value defined in the range filter control are collected, and a response comprising the collected subset of data entries is then sent to the client application. | 2012-06-28 |
20120166456 | METHOD AND APPARATUS FOR CREATING DATA TABLE OF FORENSICS DATA - An apparatus for creating a data table of a forensic data, includes a data parser configured to create primary data tables including unique attributes of the predetermined keywords by parsing the raw data having different formats for each forensics tool, each attribute having a unique standardized format. The apparatus further includes a data filter filtering specific fields or attributes from the primary data tables to newly create secondary data table. The apparatus further includes a data relation analyzer analyzing a relation between the data within the primary data tables to newly create secondary data tables. | 2012-06-28 |
20120166457 | Tagging Questions from Users on a Social Networking System - Users of a social networking system post questions for other users to answer. Questions are automatically tagged based on keywords extracted from text within the posted questions as well as user-selected tags. Answers may be voted on and sorted by social information related to the browsing user. Affinities for tags are recorded based on users' interactions with the question and answer service. Affinities for tags may also be used to target questions to other users and sort answers. | 2012-06-28 |
20120166458 | SPAM TRACKING ANALYSIS REPORTING SYSTEM - The subject application describes systems and/or methods for spam and uniform resource locator (URL) analysis reporting. The system can include components for: processing raw data associated with spam and/or URL tracking and reporting, parsing the raw data into a plurality of data elements, capturing and persisting internal and/or external information and associations about a data element included in the plurality of data elements, based on the captured or persisted internal and/or external information, building a digital trail associated with disparate data elements; and performing advanced intelligence on the disparate data elements. | 2012-06-28 |
20120166459 | SYSTEM AND METHOD FOR EXECUTING TRANSFORMATION RULES - The present disclosure is directed to executing transformation rules. In some implementations, a method includes receiving a request to apply a predefined transformation rule to a portion of a service. In response to at least the request, the predefined transformation rule is identified from a plurality of predefined transformation rules included in a business model. Each of the plurality of predefined transformation rules are configured to update at least one service independent of generating code in a service layer. The predefined transformation rule is assigned to the portion of the service. | 2012-06-28 |
20120166460 | Utilizing Metadata Generated During XML Creation to Enable Parallel XML Processing - A method, computer program product, and system for enabling parallel processing of an XML document without pre-parsing, utilizing metadata associated with the XML document and created at the same time as the XML document. The metadata is used to generate partitions of the XML document at the time of parallel processing, without requiring system-intensive pre-parsing. | 2012-06-28 |
20120166461 | LAYERING CONCEPT FOR A REPOSITORY OF A USER INTERFACE FRAMEWORK FOR WEB APPLICATIONS - Various embodiments of systems and methods for a layering concept for a repository of a user interface framework for Web applications are described herein. The content of a repository provided by different parties (e.g., vendor, partner, customer, user, etc.) is separated. The separation is achieved by assigning solutions to the parties that store content in the repository. Simplified access to the repository is achieved by layering the solutions in a stack and implementing a layer strategy for the layers and their order of access. | 2012-06-28 |
20120166462 | AUTOMATED IMAGE DATA PROCESSING AND VISUALIZATION - The present discussion relates to automated image data processing and visualization. One example can facilitate generating a graphical user-interface (GUI) from image data that includes multiple semantically-labeled user-selectable anatomical structures. This example can receive a user selection of an individual semantically-labeled user-selectable anatomical structure. The example can locate a sub-set of the image data associated with the individual semantically-labeled user-selectable anatomical structure and can cause presentation of the sub-set of the image data on a subsequent GUI. | 2012-06-28 |
20120166463 | INFORMATION PROCESSING APPARATUS, INFORMATION SEARCH METHOD AND PROGRAM - One embodiment provides an information processing apparatus, including: a search module configured to perform a search on a plurality of pages with a designated search condition, the pages being managed by an application program capable of managing information by arranging at least one object in any desired layout on each page; and a display controller configured to display at least one object extracted through the search on a screen of a display module as a search result, with a layout of each object on the page kept unchanged. | 2012-06-28 |
20120166464 | METHOD AND APPARATUS FOR PROVIDING INPUT SUGGESTIONS - An approach is provided for providing input suggestions. An input generating platform causes, at least in part, presentation of a user interface element including at least one input field. The input generating platform also determines at least one field type associated with the at least one input field. The input generating platform further identifies at least one information store, context store, or a combination thereof based, at least in part, on the at least one field type. The input generating platform also determines to migrate one or more computations for generating one or more suggestions, one or more default values, or a combination thereof for populating the at least one input field, generating the user interface element, or a combination thereof to the at least one information store, context store, or a combination thereof. | 2012-06-28 |
20120166465 | QUERY TRANSFORMATION - Methods and apparatus, including computer program products, are provided for providing value help. In one aspect, there is provided a computer-implemented method. The method may include receiving at least one field of a row of a list presented at a user interface; transforming, at a service component rather than the user interface, the at least one field into a query; and sending the transformed query to a database. Related apparatus, systems, methods, and articles are also described. | 2012-06-28 |
20120166466 | METHODS AND APPARATUS FOR ADAPTIVE SEARCHING FOR HEALTHCARE INFORMATION - Methods and apparatus for adaptive searching for healthcare information are disclosed. An example apparatus for searching healthcare information systems includes a search term counter to receive searched query terms and to receive roles of searchers entering the searched query terms, the search term counter to maintain statistics indicative of usage of the searched query terms according to roles of the corresponding searchers; an interface to receive one or more characters entered into a search field of a search service by a user; a user identifier to determine a role associated with the user; and a term selector to reference the statistics using the role associated with the user to identify a query term for suggestion to the user based on the received one or more characters and the role of the user, wherein the interface is to facilitate presentation of the identified query term as a suggestion to the user for the search service. | 2012-06-28 |
20120166467 | SYSTEMS AND METHODS FOR PROVIDING SEARCH ASSISTANCE TECHNOLOGIES BASED ON USER SELF-EFFICACY AND SEARCH FRUSTRATION - The present invention is directed towards systems and methods for providing search assistance technologies based on a user's search self-efficacy and search frustration. The method according to one embodiment of the present invention comprises receiving a search query from a user. The method then calculates the user's search self-efficacy and calculates the user's frustration with the current information task. The method then identifies a plurality of search assistance technologies based on the user's search self-efficacy and frustration. Finally, the method provides a search engine results page comprising a plurality of search results and the identified plurality of search assistance technologies. | 2012-06-28 |
20120166468 | METHOD AND SYSTEM TO UTILIZE SESSION QUERIES IN REAL TIME TO IMPROVE GEO PRECISION OF SPONSORED LISTINGS - Contextual or cumulative interpretation is applied to individual user queries to improve the accuracy of sponsored and/or non-sponsored search results. Queries are interpreted based on present features derived from a user query in the context of past features derived from qualified past queries such as those previously received during a user query session. Based on contextual interpretation, present features may be augmented using past features. A search is performed using augmented features instead of present features. Contextual interpretation of queries improves search system understanding of the context in which queries are submitted, which is particularly helpful when interpolating query intent to develop features not expressed in a query. Contextual interpretation permits queries to be interpreted and treated more uniformly and more intelligently. As a result, users and advertisers benefit from more precise sponsored and/or non-sponsored search results. As one example, contextual interpretation can improve the geo-precision of sponsored search results. | 2012-06-28 |
20120166469 | CEP engine and method for processing CEP queries - The present invention concerns a complex event processing (CEP) engine ( | 2012-06-28 |
20120166470 | SYSTEMS AND METHODS PROVIDING TOUCHSCREEN REPORT NAVIGATION - According to some embodiments, a database may store business information and meta-data associated with the business information. A processor coupled to the database may generate: (i) a first report associated with at least some of the business information, wherein the first report is to be displayed in a first area of a display of a remote touch sensitive device, and (ii) a second report associated with at least some of the business information, wherein the second report is to be displayed in a second area of the touch sensitive device. A communication port coupled to the processor may transmit the first and second reports and receive a destination location from the touch sensitive device, wherein the destination location is associated with a movement of a selected report element of the first report. According to some embodiments, the processor may, if the destination location is not associated with a report, generate a third report based on at least some of the business information and the selected report element. If the destination location is associated with the second report, the processor may generate a modified second report based on a pre-determined analytical mapping between the first and second reports, if available. | 2012-06-28 |
20120166471 | NAVIGATION OF FACETED DATA - A processor implemented method, system and computer program product presents and retrieves data directories. A facet tree is initialized to present facet-converted stored tabular data and dynamically entered user-input data on multiple facet nodes. The facet nodes represent directories for the facet-converted stored tabular data and user-input data. In response to a single facet node from the multiple facet nodes being selected by a user, the single facet node is expanded by presenting, on the facet tree, all other facet nodes from the multiple facet nodes as children of the single facet node that was selected by the user. In response to a child of the single facet node being selected, value directories for the child are retrieved and presented according to a definition of the single facet node that was expanded. | 2012-06-28 |
20120166472 | SYSTEM AND METHOD FOR COLLABORATIVE GRAPHICAL SEARCHING WITH TANGIBLE QUERY OBJECTS ON A MULTI-TOUCH TABLE - A system and a method are disclosed for developing a query. The system includes a display device for displaying elements, such as images, textures, color palettes, ad textual elements, which are selectable as query elements for forming a query. A physical space is provided on the display in which a physical object can be positioned. At least one physical object is positioned in the physical space, which is recognized by the system as having an identifier stored in memory to which a query can be linked. A sensor is provided for detecting a physical manipulation of the physical object in the physical space which represents absorbing a query element into a query. A query generator generates a query based on the absorbed query element. The query is thus associated in memory with the identifier for the recognized object. In this way, several physical objects can be manipulated on the display device, each one corresponding to a respective, single query. | 2012-06-28 |
20120166473 | EFFICIENT LABEL ACQUISITION FOR QUERY REWRITING - Systems, methods, and computer storage media having computer-executable instructions embodied thereon for rewriting queries and labeling word pairs. Queries are received and alternate words are identified for word pairs (i.e., query words and alternate words). Word pair links are presented to users and indicators are received based on actions taken by the users. Labels are assigned to the word pairs based on the indicators and communicated to a classifier. | 2012-06-28 |
20120166474 | NEUROTRANSMITTER ASSOCIATED NEURONAL IMAGE DATABASE - The present invention relates to a neuronal database system for providing neurotransmitter-related information, comprising: a database of three-dimensional morphological information of neuron with the associated neurotransmitters and a user interface for end user to access information by peripheral computer devices, such as key board or mouse. | 2012-06-28 |
20120166475 | ENHANCED BUSINESS OBJECT RETRIEVAL - A request for at least a portion of a business object is received by a database from a client in a first half of a roundtrip between the client and the database. Each of the tables includes a primary key column and a plurality of records. The primary key column provides, for each record in the table, a primary key for one of a plurality of business objects. Thereafter, the database identifies records within a set of tables among a larger number of tables in the database by matching a primary key associated with the business object with the primary key in the primary key column. Once this identification has been made, the database obtains all values responsive to the request from the identified record and transmits, in a second half of the roundtrip between the client and the database, the obtained values for the business object to the client. | 2012-06-28 |
20120166476 | OBJECT COMPARISON VIA REAL TIME METADATA CALCULATION - A system and method for real-time comparison of data objects stored in a repository. A comparison of a plurality of selected objects may be implemented. A metadata comparison summary may be displayed to the user. The comparison summary may identity the most viewed, most liked, most disliked, or also viewed objects. The metadata comparison may be displayed on a user interface via the addition of an identification icon, by color highlighting a list of objects in the repository, by displaying a comparison summary in an information panel, or by other methods of object identification. In an embodiment, the user may control the type of information displayed in the comparison summary. | 2012-06-28 |
20120166477 | Universal Interface for Retrieval of Information in a Computer System - The present invention provides convenient access to items of information that are related to various descriptors input by a user, by means of a unitary interface which is capable of accessing information in a variety of locations, through a number of different techniques. Using a plurality of heuristic algorithms to operate upon information descriptors input by the user, the present invention locates and displays candidate items of information for selection and/or retrieval. Thus, the advantages of a search engine can be exploited, while listing only relevant object candidate items of information. | 2012-06-28 |
20120166478 | JUST-IN-TIME ANALYTICS ON LARGE FILE SYSTEMS - As file systems reach the petabytes scale, users and administrators are increasingly interested in acquiring high-level analytical information for file management and analysis. Two particularly important tasks are the processing of aggregate and top-k queries which, unfortunately, cannot be quickly answered by hierarchical file systems such as ext3 and NTFS. Existing pre-processing based solutions, e.g., file system crawling and index building, consume a significant amount of time and space (for generating and maintaining the indexes) which in many cases cannot be justified by the infrequent usage of such solutions. User interests can often be sufficiently satisfied by approximate (i.e., statistically accurate) answers. A just-in-time sampling-based system can, after consuming a small number of disk accesses, produce extremely accurate answers for a broad class of aggregate and top-k queries over a file system without the requirement of any prior knowledge. The system is efficient, accurate and scalable. | 2012-06-28 |
20120166479 | SYSTEM AND METHOD FOR PROCESSING DATABASE QUERIES - The present invention provides a system and method for processing a database query between one or more clients and one or more databases. The database query, which is formatted using a first protocol, is received from one of the clients. One of the databases is selected to process the database query and the database query is translated from the first protocol to a second protocol. The translated database query is then sent to the selected database for processing. A response to the database query, which is formatted using the second protocol, is received from the selected database and the response is translated from the second protocol to the first protocol. The present invention determines which of the clients sent the database query and sends the translated response to the client that sent the database query. This method can be implemented as a computer program embodied on a computer readable medium. | 2012-06-28 |
20120166480 | XPATH-BASED SELECTION ASSISTANCE OF GUI ELEMENTS DURING MANUAL TEST SCRIPT AUTHORING FOR XML-BASED APPLICATIONS - An automated software testing system can include a test script authoring graphical user interface and an element selection assistant. The test script authoring graphical user interface is an interface for manual test script authoring of an XML representation of a GUI for software applications formed from one or more XML based source code documents. A search section is a user input section within which a user is permitted to input at least one of an XPATH expression and a text string. The element selection assistant can be for searching the XML-based code documents using a search XPATH expression. The search XPATH expression can be the XPATH expression input into the search section or a generated XPATH expression automatically generated from the text string. The result section can present results from the element selection assistant. | 2012-06-28 |
20120166481 | SYSTEM AND METHOD FOR SCALING FOR A LARGE NUMBER OF CONCURRENT USERS - Disclosed embodiments provide a system, machine-readable medium and a method that may generate a session identification for a user session of each of a plurality of users of the computer application. Cookies related to users may be retrieved from external storage using the session identification. A user context may be restored using the retrieved cookies. Functional computing logic may be called based on the restored user context. A state representation may be assembled according to data in a database. Upon completion of functions performed by the called functional computing logic, the user context and the assembled state representation may be stored as a cookie for each of users in external storage. Based on the assembled state representation, user context, and data from the accessed database, HTML code may be generated. Stateful function computing logic may be re-used by employing stateless implementations of consistency frameworks which may include lock management and update task handling performing the actual database changes. | 2012-06-28 |
20120166482 | SERVING RELIABLE CONTENT THROUGH SEARCH - A system and method for serving reliable content in search, the method comprising: receiving at a server computer from a user, a request to search a network for certain information; searching the network for the information requested and obtaining a set of results including user-generated content; searching the user's list of social connections; determining whether any of the search results related to a person in the user's list of social connections/contacts; and providing an indication of greater reliability for the search results that correspond to persons from the user's list of social connections. | 2012-06-28 |
20120166483 | Systems and Methods for Database Proxy Request Switching - The present application is directed towards systems and methods for selecting a database from a plurality of databases to forward a SQL query request based on a property of the SQL request. A device intermediary to a plurality of clients and databases may establish a plurality of connections to the plurality of databases. The device may receive, from a client of the plurality of clients, a request to execute a SQL query. The device may evaluate one or more properties of the request to execute the SQL query responsive to a policy. The device may select a database from the plurality of databases based on a result of evaluation of the one or more properties of the request to execute the SQL query. The device may forward the request to execute the SQL query to the selected database via a connection of the plurality of connections. | 2012-06-28 |
20120166484 | SYSTEM, METHOD AND COMPUTER PROGRAM FOR MULTI-DIMENSIONAL TEMPORAL DATA MINING - The present invention provides a system, method and computer program for multi-dimensional temporal abstraction and data mining. The invention comprises collecting and optionally cleaning multi-dimensional data, the multi-dimensional data including a plurality of data streams; temporally abstracting the multi-dimensional data; and relatively aligning the temporally abstracted multi-dimensional data based on a shared time point of interest. | 2012-06-28 |
20120166485 | Information Processor, Privilege Management Method, Program, and Recording Medium - In an information technology (IT) environment, a technique to manage privileges given to personnel to whom a process is assigned. An information processor includes: a configuration management database that stores resources, personnel, processes, and privileges provided on the resources as configuration items, respectively, the configuration management database prescribing relations between the configuration items including a privilege-dependency relationship between a privilege on a resource and a privilege on another resource required to exercise the privilege, a privilege-request relationship between a process and a privilege required for the process, and a privilege-giving relationship between the personnel and the privilege given to the personnel; and a privilege deriving unit for deriving a goal state of a privilege to be given to corresponding personnel by following the relation with the privilege on the resource required for a process to be executed used as a reference point by referring to the configuration management database. | 2012-06-28 |
20120166486 | SYSTEM AND METHOD FOR DYNAMIC DISPLAY OF SUMMATIONS IN COLLAPSIBLE HIERARCHICAL TABLES - The system, method and machine-readable medium that provides an efficient presentation of a hierarchical table by providing an accurate summation of table line values when the table is expanded and collapsed. | 2012-06-28 |
20120166487 | DISTRIBUTED OBJECT STORAGE SYSTEM - The invention concerns a distributed object storage system ( | 2012-06-28 |
20120166488 | MULTI-TENANT SYSTEM - Method(s) and system(s) for identifying an application behavior of a multi-tenant application for a tenant are described herein. The method includes determining whether a reference attribute of the multi-tenant application is encountered by the tenant. The reference attribute is an application attribute for which variations from a default behavior of the multi-tenant application are available. Based on the determining, it is ascertained whether a configuration template is defined for the tenant. Further, based on the ascertainment of the configuration template, the application behavior corresponding to the tenant is identified. The identified application behavior is provided to the multi-tenant application such that multi-tenant application exhibits the identified application behavior. | 2012-06-28 |
20120166489 | Presenting a Multidimensional Decision Table - A computer-implemented method for presenting a multidimensional decision table includes: receiving a decision table that defines columns as respective dimensions, each row having a value in only one of the columns, the decision table specifying results for respective value combinations in the dimensions; identifying each value in an innermost dimension of the decision table; and generating a table representation for the decision table that has a corresponding column for each of the dimensions except the innermost dimension, and a separate column for each of the identified values, wherein the separate columns include corresponding ones of the results. | 2012-06-28 |
20120166490 | GENERATING A CHECKPOINT IMAGE FOR USE WITH AN IN-MEMORY DATABASE - Additional information is provided in a checkpoint image such that direct pointers can be included in the checkpoint image. Thus, an in-memory database management system can be restored from the checkpoint image in the event of a failure without causing any significant performance drawbacks to the database management system. | 2012-06-28 |
20120166491 | PEER TO PEER DIAGNOSTIC TOOL - A diagnostic tool comprises a memory device which stores a database of parametric performance data of a collection of transaction terminals possibly owned by different entities. Each time the tool is authorized to connect to a transaction terminal the database is accessed by a processor and a determination is made whether one or more parameter of the transaction terminal lies within a threshold amount of a statistical measure based upon the parametric performance data of the collection of transaction terminals. | 2012-06-28 |
20120166492 | DATABASE TRANSFERS USING CONSTRAINT FREE DATA - A database management tool may migrate a portion of a constrained database by transferring the portion to a constraint-free database from a first constrained database, then populating a second constrained database using the constraint-free data. The constraint-free data may be transformed prior to populating to update internal database identifiers. In some cases, the transformation may also update the data to a different schema of the target database. The database management tool may also include a load balancer that may monitor the loads on a distributed database and may separate portions of the database to different database instances to more effectively load balance the larger database. | 2012-06-28 |
20120166493 | SHADOW SYSTEM START DURING UPGRADE OF AN ORIGINAL SYSTEM - In one general aspect, a computer system can include instructions stored on a non-transitory computer-readable storage medium. The computer system can include a program database module configured to define, at a shadow system, a shadow program database including data and a structure collectively defining an upgrade to an original program database on an original system. The computer system can include a basis module configured to define at the shadow system a shadow basis database related to start functionality of the shadow system. The computer system can also include a downtime execution module configured to trigger the shadow system to change from a downstate to an upstate based on a combination of data included in the shadow basis database and the data of the shadow program database. | 2012-06-28 |
20120166494 | COMPUTER READABLE MEDIUM AND INFORMATION PROCESSING APPARATUS - A computer readable medium stories a program causing a computer to execute a process for information processing. The process includes acquiring first data, generating first structure data based on the first data, generating substructure data, acquiring second data, generating second structure data based on the second data, generating structure data based on the substructure data, and determining whether the structure is included in the second structure. | 2012-06-28 |
20120166495 | MASS MODIFICATION OF ATTRIBUTE VALUES OF OBJECTS - Various embodiments of systems and methods for mass modification of attribute values of objects are described. The methods include systematically analyzing attributes assigned to multiple objects, displaying the results to the user, enabling mass modification functionality in the user interface, and providing the user a comprehensive variety of options on how to proceed with mass editing. | 2012-06-28 |