Patent application number | Description | Published |
20130262249 | Redemption Network with Transaction Sequencer - A transaction sequencer that comprises a processor, a non-transitory memory, and an application stored in the non-transitory memory. The application receives a message comprising information about a first purchase item, wherein the message was created by a point-of-sale after a filtering step that assured that the first purchase item is associated with a master approved item list, searches a plurality of different approved product lists using the information about the first item, wherein the plurality of different approved product lists comprise a first approved product list and a second approved product list, creates a first transaction based on finding the first item in the first approved product list, transmits the first transaction to a first transaction processing system, receives a first response from the first transaction processing system, bundles the first response in a unified response, and transmits the unified response. | 10-03-2013 |
20140116908 | Card Product Package Assembly Having Enhanced Security - A package for display and sale of a card product comprising a first portion including a first panel connected to a second panel via a first fold line and a third panel connected to the second panel via a second fold line, the first panel including a first opening, the third panel including a second opening, which, in a folded state where the first panel has been folded to overlap the second panel via the first fold line and the second panel has been folded to overlap the third panel via a second fold line and the fourth panel has been folded to overlap the third panel via the third fold line, the first opening at least partially overlaps the second opening, a second portion foldably connected to the first portion, wherein the second portion displays information about the card product, a first fastener, and a second fastener releasably attached to the first fastener when the first portion and the second portion are in a closed position, wherein the first fastener and the second fastener re-attachably separate from one another when the first portion and the second portion are in an open position. | 05-01-2014 |
20160039590 | Card Product Package Assembly Having Enhanced Security - A package for display and sale of a card product comprising a first portion including a first panel connected to a second panel via a first fold line and a third panel connected to the second panel via a second fold line, the first panel including a first opening, the third panel including a second opening, which, in a folded state where the first panel has been folded to overlap the second panel via the first fold line and the second panel has been folded to overlap the third panel via a second fold line and the fourth panel has been folded to overlap the third panel via the third fold line, the first opening at least partially overlaps the second opening, a second portion foldably connected to the first portion, wherein the second portion displays information about the card product, a first fastener, and a second fastener releasably attached to the first fastener when the first portion and the second portion are in a closed position, wherein the first fastener and the second fastener re-attachably separate from one another when the first portion and the second portion are in an open position. | 02-11-2016 |
Patent application number | Description | Published |
20100017850 | METHODS AND SYSTEMS TO FINGERPRINT TEXTUAL INFORMATION USING WORD RUNS - The present invention provides methods and systems to enable fast, efficient, and scalable means for fingerprinting textual information using word runs. The present system receives textual information and provides algorithms to convert the information into representative fingerprints. In one embodiment, the fingerprints are recorded in a repository to maintain a database of an organization's secure data. In another embodiment, textual information entered by a user is verified against the repository of fingerprints to prevent unauthorized disclosure of secure data. This invention provides approaches to allow derivative works (e.g., different ordering of words, substitution of words with synonyms, etc.) of the original information to be detected at the sentence level or even at the paragraph level. This invention also provides means for enhancing storage and resource efficiencies by providing approaches to optimize the number of fingerprints generated for the textual information. | 01-21-2010 |
20100064347 | METHODS AND SYSTEMS FOR PROTECT AGENTS USING DISTRIBUTED LIGHTWEIGHT FINGERPRINTS - The present invention provides methods and systems to protect an organization's secure information from unauthorized disclosure. The present system uses protect agents installed across various egress points (e.g., email server, user's computer, etc.) to monitor information disclosed by a user. The present system also provides the use of lightweight fingerprint databases (LFD) to maintain a database of fingerprints associated with the organization's secure data. In one embodiment, the LFD is stored locally at the site of each protect agent such that the organization's secure information can be protected even when a protect agent is disconnected from the network. Methods and systems to compress fingerprints to achieve the lightweight fingerprint databases are also provided. In one embodiment, a combined approach, utilizing both the local lightweight fingerprint database and a remote fingerprint server comprising registered fingerprints is used to achieve overall protection of the organization's secure information. | 03-11-2010 |
20100064372 | METHODS AND SYSTEMS TO IMPLEMENT FINGERPRINT LOOKUPS ACROSS REMOTE AGENTS - The present invention provides methods and systems to protect an organization's secure information from unauthorized disclosure. The present system uses protect agents installed across various egress points (e.g., email server, user's computer, etc.) to monitor information disclosed by a user. The present system also provides the use of fingerprint servers to remotely maintain a database of fingerprints associated with the organization's secure data. In one embodiment, the protect agents transmit fingerprints associated with the user's information to the fingerprint server utilizing a local network or the public internet. The protect agents then receive a comparison analysis from the fingerprint servers and execute appropriate security action based on the analysis. In one embodiment, a combination of the local network and public internet is utilized to achieve remote agent lookups. | 03-11-2010 |
20100299727 | METHODS AND SYSTEMS FOR EXACT DATA MATCH FILTERING - A technique for efficiently preventing exact data words (“entities”) from unauthorized disclosure is disclosed. Protect agents installed at various egress points identify candidate entities from digital information desired to be disclosed by a user. The candidate entities are compared against registered entities stored in a lightweight entity database (LWED). If a candidate entity matches against a registered entity in the LWED, the protect agent initiates a security action. Alternately, the protect agent transmits the matching candidate entity to a global entity database (GED) server to receive additional confirmation on whether the candidate entity matches a registered entity. In some instances, the protect agent also receives (from the GED server) metadata information associated with the matching candidate entity. The protect agent utilizes the metadata information to initiate suitable security actions. | 11-25-2010 |
20130074198 | METHODS AND SYSTEMS TO FINGERPRINT TEXTUAL INFORMATION USING WORD RUNS - The present invention provides methods and systems to enable fast, efficient, and scalable means for fingerprinting textual information using word runs. The present system receives textual information and provides algorithms to convert the information into representative fingerprints. In one embodiment, the fingerprints are recorded in a repository to maintain a database of an organization's secure data. In another embodiment, textual information entered by a user is verified against the repository of fingerprints to prevent unauthorized disclosure of secure data. This invention provides approaches to allow derivative works (e.g., different ordering of words, substitution of words with synonyms, etc.) of the original information to be detected at the sentence level or even at the paragraph level. This invention also provides methods and systems for enhancing storage and resource efficiencies by providing approaches to optimize the number of fingerprints generated for the textual information. | 03-21-2013 |
20150286831 | METHODS AND SYSTEMS FOR PREVENTING TRANSMISSION OF SENSITIVE DATA FROM A REMOTE COMPUTER DEVICE - A technique for preventing selected sets of data words from unauthorized transmission out of the secure perimeter of a computer system is disclosed. A set of security rules is applied to an outgoing data message and if one of the set of rules is triggered, at least a portion of the message is transmitted to a central server that is within the secure perimeter, for scanning by another set of security rules. The central server then sends a security command back to the remote device, which executes the security command before transmitting the outgoing message out of the secure perimeter of the computer system. | 10-08-2015 |
Patent application number | Description | Published |
20080263008 | APPARATUS AND METHOD FOR OPTIMIZING DESCENDANT PATH EVALUATION IN XPATH/XQUERY - An apparatus and method for optimizing descendant path evaluation in XPath/XQuery includes generating a list of unique paths in a tree structure of an XML document. Each unique path includes one or more nodes of the tree structure. A query is received specifying a descendant node for retrieval from the tree structure. From the list, unique paths are identified that include the descendant node. A navigation aid is then generated to assist in traversing the unique paths that include the descendant node. Using the navigation aid as a guide, descendant nodes in the tree structure may be retrieved by traversing only unique paths that include the descendant node. | 10-23-2008 |
20090063399 | INDEX SELECTION FOR XML DATABASE SYSTEMS - A method, system, and computer program product for selecting indexes to be created over XML data are provided. The method, system, and computer program product provide for receiving a workload for the XML data, the workload including one or more database statements, and utilizing an optimizer to recommend a set of one or more path expressions based on the workload received, wherein the set of one or more path expressions is to be used to create one or more indexes over the XML data. | 03-05-2009 |
20130080441 | INDEX SELECTION FOR XML DATABASE SYSTEMS - A method, computer-implemented system, and computer program product for creating indexes over XML data managed by a database system are provided. The method, computer-implemented system, and computer program product provide for receiving a workload for the XML data, the workload including one or more database statements, utilizing an optimizer of the database system to enumerate a set of one or more path expressions by creating a virtual universal index based on the workload received and matching a path expression to the virtual universal index, and recommending one or more path expressions from the set of one or more candidate path expressions to create the indexes over the XML data. | 03-28-2013 |
Patent application number | Description | Published |
20100211572 | INDEXING AND SEARCHING JSON OBJECTS - Disclosed is a method of encoding JavaScript Object Notation (JSON) documents in an inverted index, wherein a tree representation of a JSON document is first generated, and, next, the JSON document is shredded into a list of tuples for each atom node, n, in the tree, where value is a label associated with n, path is a concatenation of node labels associated with ancestors of n, type is a description of a type of value, and jdewey of n is a partial Dewey code of its closest ancestor array node, if one exists, or empty, otherwise. Lastly, an inverted index is built using as index term, and jdewey as payload. A method is also described to search the inverted index. | 08-19-2010 |
20120311581 | ADAPTIVE PARALLEL DATA PROCESSING - Described herein are methods, systems, apparatuses and products for adaptive parallel data processing. An aspect provides providing a map phase in which at least one map function is applied in parallel on different partitions of input data at different mappers in a parallel data processing system; providing a communication channel between mappers using a distributed meta-data store, wherein said map phase comprises mapper data processing adapted responsive to communication with said distributed meta-data store; and providing data accessible by at least one reduce phase node in which at least one reduce function is applied. Other embodiments are disclosed. | 12-06-2012 |
20130013552 | Interest-Driven Business Intelligence Systems and Methods of Data Analysis Using Interest-Driven Data Pipelines - Interest-driven Business Intelligence (BI) systems in accordance with embodiments of the invention are illustrated. In one embodiment of the invention, a data processing system includes raw data storage containing raw data, metadata storage containing metadata that describes the raw data, and an interest-driven data pipeline that is automatically compiled to generate reporting data using the raw data, wherein the interest-driven data pipeline is compiled based upon reporting data requirements automatically derived from at least one report specification defined using the metadata. | 01-10-2013 |
20130226860 | Interest-Driven Business Intelligence Systems and Methods of Data Analysis Using Interest-Driven Data Pipelines - Interest-driven Business Intelligence (BI) systems in accordance with embodiments of the invention are illustrated. In one embodiment of the invention, a data processing system includes raw data storage containing raw data, metadata storage containing metadata that describes the raw data, and an interest-driven data pipeline that is automatically compiled to generate reporting data using the raw data, wherein the interest-driven data pipeline is compiled based upon reporting data requirements automatically derived from at least one report specification defined using the metadata. | 08-29-2013 |
20130238551 | Interest-Driven Business Intelligence Systems and Methods of Data Analysis Using Interest-Driven Data Pipelines - Interest-driven Business Intelligence (BI) systems in accordance with embodiments of the invention are illustrated. In one embodiment of the invention, a data processing system includes raw data storage containing raw data, metadata storage containing metadata that describes the raw data, and an interest-driven data pipeline that is automatically compiled to generate reporting data using the raw data, wherein the interest-driven data pipeline is compiled based upon reporting data requirements automatically derived from at least one report specification defined using the metadata. | 09-12-2013 |
20140114970 | Systems and Methods for Interest-Driven Data Visualization Systems Utilized in Interest-Driven Business Intelligence Systems - Systems and methods for interest-driven data visualization systems in accordance with embodiments of the invention are illustrated. In one embodiment, an interest-driven data visualization system includes a processor, a memory connected configured to store an interest-driven data visualization application, and metadata storage, wherein the interest-driven data visualization application configures the processor to define reporting data requirements, generate data retrieval job data based on the reporting data requirements, transmit the data retrieval job data, receive aggregate data, create at least one piece of reporting data using the received aggregate data and the reporting data requirements, associate visualization metadata with the reporting data describing the visual appearance of the at least one piece of reporting data, and generate a report using the reporting data requirements and the visualization metadata. | 04-24-2014 |
20140114971 | Systems and Methods for Interest-Driven Data Sharing in Interest-Driven Business Intelligence Systems - Systems and methods for interest-driven data sharing in interest-driven business intelligence systems in accordance with embodiments of the invention are illustrated. In one embodiment, an interest-driven data sharing server system includes a processor, a memory configured to store an interest-driven data sharing application, raw data storage, metadata storage configured to store data description metadata describing the raw data, and report storage configured to store previously generated reports, wherein the interest-driven data sharing application configures the processor to receive a report specification, locate at least one previously generated report stored in the report storage, identify raw data stored in the raw data storage using the data description metadata and at least one of the reporting data requirements, calculate redundant data metadata using the located previously generated reports and the identified raw data, determine modified reporting data requirements, retrieve updated source data, and generate reporting data based on the updated source data. | 04-24-2014 |
20140258209 | Systems and Methods for Interest-Driven Distributed Data Server Systems - Systems and methods for interest-driven business intelligence systems in accordance with embodiments of the invention are illustrated. In one embodiment, an interest-driven distributed data server system includes a processor, an interest-driven distributed data server application, aggregate data storage, and a data source directory, wherein the interest-driven distributed data server application configures the processor to obtain reporting data requirements, determine at least one data dimension using the reporting data requirements, identify at least one data source identified that can provide data associated with the data dimension, generate data source job data, transmit the data source job data to at least one data source, and receive job response data, store the received job response data in the aggregate data storage, build reporting data based on the reporting data requirements, and transmit the reporting data. | 09-11-2014 |
20150081618 | Systems and Methods for Interest-Driven Business Intelligence Systems Including Event-Oriented Data - Systems and methods for interest-driven business intelligence systems including event-oriented data in accordance with embodiments of the invention are illustrated. In one embodiment, an interest-driven business intelligence system includes raw data storage configured to contain raw data and perform ETL processes, a data mart configured to contain metadata that describes the raw data, and an intermediate processing layer, wherein the intermediate processing layer is configured to compile an interest-driven data pipeline configured to generate ETL processing jobs to generate event-oriented data from the raw data by filtering the raw data based on the metadata describing the raw data, determining ordering data based on the metadata describing the raw data, aligning the filtered raw data based on the ordering data, and generating event-oriented data based on the aligned filtered raw data, and storing the event-oriented data in the data mart. | 03-19-2015 |
20150081619 | Systems and Methods for Interest-Driven Business Intelligence Systems Including Geo-Spatial Data - Systems and methods for interest-driven business intelligence systems including geo-spatial data in accordance with embodiments of the invention are illustrated. An interest-driven business intelligence system including raw data storage and perform extract, transform, and load processes, a data mart, and an intermediate processing layer, wherein the intermediate processing layer is configured to automatically generate metadata describing the raw data, derive reporting data requirements, and compile an interest-driven data pipeline based upon the reporting data requirements, where compiling the interest-driven data pipeline includes generating ETL processing jobs to generate geo-spatial data from the raw data, determining bounding data, bounding the filtered raw data based on the bounding data, generating geo-spatial data, and storing the geo-spatial data, generating reporting data including data satisfying the reporting data requirements based on the geo-spatial data, and storing the reporting data in the data mart for exploration by an interest-driven data visualization system. | 03-19-2015 |
20150112969 | Systems and Methods for Interest-Driven Data Visualization Systems Utilizing Visualization Image Data and Trellised Visualizations - Systems and methods for interest-driven data visualization systems in accordance with embodiments of the invention are illustrated. In one embodiment, an interest-driven data visualization system includes a processor and a memory configured to store an interest-driven data visualization application, wherein the interest-driven data visualization application configures the processor to define reporting data requirements, generate data retrieval job data based on the at least one piece of reporting data metadata and the data description metadata, transmit the data retrieval job data to an interest-driven business intelligence server system, receive aggregate data from the interest-driven business intelligence server system, create at least one piece of reporting data using the received aggregate data, the data description metadata, and the reporting data metadata, generate a report using the at least one piece of reporting data, the reporting data requirements, and the visualization metadata, and generate visualization image data based on the generated report. | 04-23-2015 |
Patent application number | Description | Published |
20080222101 | APPARATUS AND METHOD FOR HANDLING A LET BINDING - An apparatus and method are disclosed for handling a LET binding used in a WHERE clause of an XQuery FLWOR expression during an XML pivot join procedure. The disclosed apparatus and method enable an XML pivot join procedure to accurately process a query and return one or more qualifying document. A logical expression within the WHERE clause is identified. Next steps of the logical expression are separated by logical operators. The LET binding is incorporated with each next step. The XQuery FLWOR expression is rewritten using the incorporations along with a FOR binding of the XQuery FLWOR expression to make a syntactically equivalent XPath query. Predicates of the LET binding may also be incorporated with the next steps, without altering the predicates. | 09-11-2008 |
20080222187 | METHOD AND APPARATUS FOR HANDLING A LET BINDING - An apparatus and method are disclosed for handling a LET binding used in a WHERE clause of an XQuery FLWOR expression during an XML pivot join procedure. XPath steps under a LET binding are identified and marked as bindings. During a match graph construction phase of the pivot join procedure, the bindings are linked to a first common non-LET binding ancestor, while traversing from the bottom up. A location identifier for each binding is truncated to the location identifier of the first common non-LET binding ancestor to create a truncated location identifier. The truncated location identifier is compared to a node identification of a FOR binding of the XQuery FLWOR expression. A match of the node identifications will qualify the XML document and the XML document is returned by the XML pivot join procedure. | 09-11-2008 |
20080243800 | SYSTEM AND METHOD FOR GENERATING AND USING A DYNAMIC BLOOD FILTER - A dynamic Bloom filter comprises a cascaded set of Bloom filters. The system estimates or guesses a cardinality of input items, selects a number of hash functions based on the desired false positive rate, and allocates memory for an initial Bloom filter based on the estimated cardinality and desired false positive rate. The system inserts items into the initial Bloom filter and counts the bits set as they are inserted. If the number of bits set in the current Bloom filter reaches a predetermined target, the system declares the current Bloom filter full. The system recursively generates additional Bloom filters as needed for items remaining after the initial Bloom filter is filled; items are checked to eliminate duplicates. Each of the set of Bloom filters is individually queried to identify a positive or negative in response to a query. When the system is configured such that the false positive rate of each successive Bloom filter is decreased by one half, the system guarantees a false positive rate of at most twice the desired false positive rate. | 10-02-2008 |
20080243941 | SYSTEM AND METHOD FOR GENERATING A CACHE-AWARE BLOOM FILTER - A cache-aware Bloom filter system segments a bit vector of a cache-aware Bloom filter into fixed-size blocks. The system hashes an item to be inserted into the cache-aware Bloom filter to identify one of the fixed-size blocks as a selected block for receiving the item and hashes the item k times to generate k hashed values for encoding the item for insertion in the in the selected block. The system sets bits within the selected block with addresses corresponding to the k hashed values such that accessing the item in the cache-aware Bloom filter requires accessing only the selected block to check the k hashed values. The size of the fixed-size block corresponds to a cache-line size of an associated computer architecture on which the cache-aware Bloom filter is installed. | 10-02-2008 |
20090070313 | ADAPTIVELY REORDERING JOINS DURING QUERY EXECUTION - A method is disclosed for executing a predetermined query plan, the method comprising: executing a portion of the query plan; providing a reordered query plan; comparing ranking metrics for the query plans; and executing the query plan having the lower ranking metric. | 03-12-2009 |
20090192980 | Method for Estimating the Number of Distinct Values in a Partitioned Dataset - The task of estimating the number of distinct values (DVs) in a large dataset arises in a wide variety of settings in computer science and elsewhere. The present invention provides synopses for DV estimation in the setting of a partitioned dataset, as well as corresponding DV estimators that exploit these synopses. Whenever an output compound data partition is created via a multiset operation on a pair of (possibly compound) input partitions, the synopsis for the output partition can be obtained by combining the synopses of the input partitions. If the input partitions are compound partitions, it is not necessary to access the synopses for all the base partitions that were used to construct the input partitions. Superior (in certain cases near-optimal) accuracy in DV estimates is maintained, especially when the synopsis size is small. The synopses can be created in parallel, and can also handle deletions of individual partition elements. | 07-30-2009 |
Patent application number | Description | Published |
20080232219 | High throughput system for legacy media conversion - A system and method for creating digital content from a plurality of legacy media formats, such as paper, CD, VHS, DVD, etc. A coordination node is utilized to balance the computation load between the various processing units, particularly those involved in the second stage of operation. Extraction units are used to input various types of information into the system as digital media. Once the information has been extracted, the coordination node and its associated software determine the load on each processing unit in the second stage and based on this and other factors, determine which processing unit will perform the conversion. The output is then stored in storage devices. This approach maximizes system utilization, while being more cost efficient than traditional extraction systems. | 09-25-2008 |
20080235217 | System and method for creating, verifying and integrating metadata for audio/video files - The present invention discloses a system and method for insuring the integrity and format of metadata. In the preferred embodiment, a local database is created into which metadata information can be stored. Since the database is maintained locally, it can be guaranteed to have correct and complete metadata information. Metadata searches are preferably performed hierarchically, such that the local database is checked first for the required data. If the data is not resident in the local database, the traditional search of third-party databases is performed. Information retrieved from third-party databases is then verified, such as manually. Once the metadata has been checked and approved, the metadata is then stored locally. A set of rules is also created, which define the requirements and the file manipulations that must be preformed on the metadata for each type of target device. | 09-25-2008 |
20080235524 | System for peripheral re-enumeration - The present invention reduces the need for peripherals to be physically removed and re-installed when a malfunction occurs. In one embodiment, a device is placed in series between the system and the peripheral. This device controls the passage of power to the peripheral. When the peripheral malfunctions, the device disallows passage of power to the peripheral, and at some later point restores power, effectively emulating a physical removal and re-installation. In a second embodiment, additional software is added to the software driver for the peripheral. In this scenario, the additional software, upon detecting that the peripheral is incommunicative, would remove power being supplied to the peripheral by the system. Again, at some later point, power is restored, thereby emulating a disconnect/reconnect sequence. | 09-25-2008 |