Abstract: A method for receiving text files, each having data defined in various format types. The text files are received without a reference to a schema defining the text files. A description file for each of the text files describing one of the format types is received and the description file includes a separate file from a corresponding text file. Before processing the text file and absent receiving the schema, the method identifies a data structure of the description file, the data structure comprising one or more parameters and definitions of the various format types. Each of the text files is processed and during processing of each of the text files, dynamically generating, at run-time, one or more reader engines to read the data in the text files and dynamically extracting, at run-time, data based on the identified data structure. The method generates an output file with the extracted data.

Abstract: A method for receiving text files, each having data defined in various format types. The text files are received without a reference to a schema defining the text files. A description file for each of the text files describing one of the format types is received and the description file includes a separate file from a corresponding text file. Before processing the text file and absent receiving the schema, the method identifies a data structure of the description file, the data structure comprising one or more parameters and definitions of the various format types. Each of the text files is processed and during processing of each of the text files, dynamically generating, at run-time, one or more reader engines to read the data in the text files and dynamically extracting, at run-time, data based on the identified data structure. The method generates an output file with the extracted data.

Abstract: Provided is a method for aggregating data from real-time events (e.g., payment transactions). The method may include receiving event (e.g., transaction) data associated with a plurality of events (e.g., payment transactions). First aggregation of interest data associated with a type of aggregation of interest may be received. A first key associated with each event (e.g., transaction) may be determined based on a first portion of the event (e.g., transaction) data associated with each event (e.g., transaction) and the first aggregation of interest data. A first value based at least partially on a first plurality of the first keys associated with a first subset of the plurality of payment transactions may be communicated based on a first user request. A system and computer program product are also disclosed.

Abstract: 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.

Abstract: A computer automatically reads each object in a metadata that is descriptive of a database. Then the computer automatically applies a number of rules, to check if the object triggers a rule. If so, then the computer automatically changes the metadata as per an action identified by the triggered rule. After all rules are applied to the object, and after all objects in the metadata are processed, the resulting metadata is used to change the database's structure. The objects may be read from the metadata in an order (e.g. hierarchy) specified in meta-metadata that is descriptive of the metadata.

Abstract: 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.

Abstract: 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.

Abstract: Embodiments of the invention provide for applying modifications to database instances in a way that allows some of instances to be modified without requiring that all of the instances be modified. Patching less than all of a plurality of replicated database instances can comprise applying a patch to a first version of a table in a first database instance. The first version of the table may be replicated in a corresponding first version of the table in a second database instance. Applying the patch to the first version of the table in the first database instance can result in a second version of the table in the first database instance. Transformations caused by applying the patch to the first version of the table in the first database instance can be consolidated based on differences between the first version of the table and the second version of the table.

Abstract: Embodiments of the invention provide for applying modifications to database instances in a way that allows some of instances to be modified without requiring that all of the instances be modified. Patching less than all of a plurality of replicated database instances can comprise applying a patch to a first version of a table in a first database instance. The first version of the table may be replicated in a corresponding first version of the table in a second database instance. Applying the patch to the first version of the table in the first database instance can result in a second version of the table in the first database instance. Transformations caused by applying the patch to the first version of the table in the first database instance can be consolidated based on differences between the first version of the table and the second version of the table.

Abstract: A method and apparatus for analyzing potential inclusion dependencies between columns of database tables is provided. A client issues a command, e.g., a SQL statement, to a database server. The command is processed at the database server without the performance of a join. Result data that indicates any exact inclusion dependencies or approximate inclusion dependencies between columns of database tables identified in the command is transmitted from the database server to the client. In processing the command, values stored in columns of database tables are converted into integer representations that require fewer resources to analyze. Disclosed techniques provide for the use of an index on a single database table rather than defining an index on each database table, which can be impractical. Further, the performance of only one pass on the data is required to identify any inclusion dependencies between columns of database tables.