Patent application number | Description | Published |
20090292985 | SYSTEM AND METHOD FOR SCHEMA EVOLUTION IN AN E-COMMERCE NETWORK - A method and computer system are described for conducting commercial transactions. An enhanced type of XML schema may be used which supports integrity constraints and polymorphism. Schemas are identified by the use of Uniform Resource Names. XML processors residing on transaction servers or trading partner servers parse document instances by retrieving the URNs corresponding to the schemas used to interpret the document. The URNs are converted to location-dependent URIs in order to locate the schemas. URNs are resolved to location-dependent URIs by use of the LDAP protocol. URNs may be converted to LDAP URLs which are used to search LDAP compliant directories. The directories serve as registries for the URI values corresponding to the URNs. | 11-26-2009 |
20100199172 | XML streaming transformer (XST) - The present invention includes devices and methods to specify a document transformation. A template specifies a transformation that is applied to a document in a streaming mode, without building a full object tree in memory representing the document. | 08-05-2010 |
20120317121 | METHODS AND SYSTEMS FOR USING DISTRIBUTED MEMORY AND SET OPERATIONS TO PROCESS SOCIAL NETWORKS - Systems and methods for managing and evaluating a social network. The social network is represented as a graph structure and stored in distributed memory. A viable path from one node that is not directly connected to another node in the graph structure may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found providing a connection between the nodes. When midpoint nodes are found, the paths connecting the one node to the other node may be reconstructed. | 12-13-2012 |
20120317149 | METHODS AND SYSTEMS FOR PROCESSING GRAPHS USING DISTRIBUTED MEMORY AND SET OPERATIONS - Systems and methods for operating a database using distributed memory and set operations, and for evaluating graphs stored in the database. Any system may be represented as a graph structure having nodes and edges. The graph structure is stored in a distributed memory system using a key/value schema wherein each node is stored as a key and a set of neighbor nodes is stored as the corresponding value. A short path from one node to another may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found indicating connections between the nodes. When the midpoint nodes are found, the paths connecting the nodes may be reconstructed. | 12-13-2012 |
20130007595 | SYSTEM AND METHOD FOR SCHEMA EVOLUTION IN AN E-COMMERCE NETWORK - A method and computer system are described for conducting commercial transactions. An enhanced type of XML schema may be used which supports integrity constraints and polymorphism. Schemas are identified by the use of Uniform Resource Names. XML processors residing on transaction servers or trading partner servers parse document instances by retrieving the URNs corresponding to the schemas used to interpret the document. The URNs are converted to location-dependent URIs in order to locate the schemas. URNs are resolved to location-dependent URIs by use of the LDAP protocol. URNs may be converted to LDAP URLs which are used to search LDAP compliant directories. The directories serve as registries for the URI values corresponding to the URNs. | 01-03-2013 |
20130238545 | SYSTEM AND METHOD FOR FAST EVALUATION OF STANDING QUERIES IN CONJUNCTIVE NORMAL FORM - Methods and systems are provided for evaluating standing queries against updated contact entries configured as a stream of facts. The method includes resolving the standing queries into an array of rules, each rule having a first and a second condition; sorting t one of the facts into a first property and a second property; comparing the first property of the fact to the first condition of each rule in the array of rules to produce a first subset of matching rules; comparing the second property of the fact to the second condition of each rule in the first subset of rules to produce a second subset of matching rules; and reporting at least one of the second subset of rules to an author of the matching rule. The method further includes populating a first hash with indicia of the first subset, and populating a second hash with the second subset. | 09-12-2013 |
20140020120 | SYSTEM AND METHOD FOR ACCESS CONTROL FOR DATA OF HETEROGENEOUS ORIGIN - Systems and methods are provided for controlling access to data of heterogeneous origin. A system creates combined access rights from access rights and other access rights for combined data that includes data and other data. The system receives a request to access data that is part of the combined data. The system determines whether to provide access to at least part of the data based on access rights that are part of the combined access rights. The system provides access to at least part of the data in response to a determination to provide access to at least part of the data based on the access rights that are part of the combined access rights. | 01-16-2014 |
20140025369 | SYSTEM AND METHOD FOR PHRASE MATCHING WITH ARBITRARY TEXT - A system and method for matching phrases having arbitrary text. A first data structure stores a list of common phrases having multiple words. Each unique word is indexed in a hash table and mapped to one or more values that describe attributes of using the word in one or more of the common phrases. Using the hash table and the list of common phrases, a temporary array is defined to keep track of possible matches between words in an input string and the list of common phrases. | 01-23-2014 |
20140025683 | METHODS AND APPARATUS FOR MANAGING COMMUNITY-UPDATEABLE DATA - A method of managing crowdsourced data includes storing contact information regarding a plurality of contacts within a community-updateable repository accessible by a plurality of users, receiving a plurality of discrepancy reports associated with a selected contact of the plurality of contacts, extracting fact data regarding the selected contact from the plurality of discrepancy reports, determining an action to be taken based on the fact data and a fact model applied to the fact data, and performing the action to modify the community-updateable repository. | 01-23-2014 |
20140081978 | FACILITATING DISTRIBUTED DATA PROCESSING FOR DYNAMIC AND EFFICIENT GENERATION OF SEARCH RESULTS IN AN ON-DEMAND SERVICES ENVIRONMENT - In accordance with embodiments, there are provided mechanisms and methods for facilitating distributed data processing for dynamic and efficient generation of search results in a multi-tenant environment according to one embodiment. In one embodiment and by way of example, a method includes receiving, at a data processing platform, extracted data occurrences from a database coupled to a server computing device, where each data occurrence may be assigned a classification according to a category. The method may further include mapping values to the data occurrences based on classifications of the data occurrences, mapping prefixes to the data occurrences based on identifying names of the data occurrences, and generating search data based on the mapped values and mapped prefixes, where the search data may represent autosuggestions. | 03-20-2014 |
20140289187 | SYSTEM AND METHOD FOR EVALUATING CLAIMS TO UPDATE A RECORD FROM CONFLICTING DATA SOURCES - A system and method for evaluating claims from sources to update database records. A trust score is developed for each source. If a source submits a claim, the trust score for that source and the value of the claim are evaluated against prior conflicting claims. If the current claim is deemed the most likely, then it is adopted as provisional “truth”. If not, the current claim is rejected. | 09-25-2014 |
20140304054 | SYSTEM AND METHOD FOR HANDLING GAMIFICATION FRAUD - Some embodiments of the present invention include determining if updates performed by a second user include a systematic change such as a reversal of an update previously performed by a first user within a time window. The reversal is associated with a record of data used by a gamification application executing in a computer system. A time delay is introduced between the update performed by the second user and rewarding the second user if the update performed by the second user includes the reversal within the time window. An update history of the first user and the second user is evaluated to identify pattern of reversals associated with similar records within the time window. The second user is prevented from being rewarded based on identifying that there are patterns of reversals from the update history occurring within the time window. | 10-09-2014 |
20140304245 | ATOMIC TRANSACTIONS IN A NOSQL DATABASE - Systems and methods are provided for atomic transactions in a NoSQL database. A system writes a pending transaction identifier to write claim data for a first data item in a NoSQL database in response to a determination that the write claim data for the first data item includes a first previous transaction identifier included in last commit data for the first data item. The system writes the pending transaction identifier and a pending commit identifier to the last commit data for the first data item. The system writes a first value associated with a pending transaction to the first data item. The system aborts the pending transaction in response to a determination that the write claim data for the first data item does not include the first previous transaction identifier included in the last commit data for the first data item. | 10-09-2014 |
20140304279 | SYSTEMS AND METHODS FOR OF IDENTIFYING ANOMALOUS DATA IN LARGE STRUCTURED DATA SETS AND QUERYING THE DATA SETS - The technology disclosed relates to automatic generation of tuples from a record set for outlier analysis. Applying this new technology, user need not specify which 1-tuples to combine into n-tuples. The tuples are generated from structured records organized into features (that also could be fields, objects or attributes.) Tuples are generated from combinations of feature values in the records. Thresholding is applied to manage the number of tuples generated. The technology disclosed further relates to indexing and searching high dimensional tuple spaces in a computer-implemented system. | 10-09-2014 |
20150026565 | XML STREAMING TRANSFORMER (XST) - The present invention includes devices and methods to specify a document transformation. A template specifies a transformation that is applied to a document in a streaming mode, without building a full object tree in memory representing the document. | 01-22-2015 |