Patent application number | Description | Published |
20110145220 | SYSTEM AND METHOD FOR EXECUTING A QUERY - There is provided a computer-implemented method of executing a query. An exemplary method comprises optimizing the query. The query may specify multiple operations on corresponding multiple column sets of a table in a database. The exemplary method further comprises partitioning data of the table based on the operations within a single pass of the table. Additionally, the exemplary method comprises performing the operations on the partitioned data in parallel. | 06-16-2011 |
20120084287 | ESTIMATION OF UNIQUE DATABASE VALUES - Estimation of unique values in a database can be performed where a data field having multiple information values is provided in the database. The data field can be partitioned into multiple intervals such that each interval includes a range of information values. An interval specific Bloom filter can be calculated for each of the multiple intervals. A binary Bloom filter value can be calculated for an information value within an interval specific Bloom filter. The binary Bloom filter value can represent whether the information value is unique. A number of unique values in the database can be determined based on calculated binary Bloom filter values. | 04-05-2012 |
20130226941 | SYSTEM AND METHOD FOR CLASSIFYING SIGNALS USING THE BLOOM FILTER - The present disclosure generally relates to data processing. Bloom filters are used to process data at high speed. A Bloom filter that is initialized based on a source string can be used to quickly determine the similarity between the source string and a query string. | 08-29-2013 |
20130226972 | METHODS AND SYSTEMS FOR PROCESSING DATA ARRAYS USING BLOOM FILTERS - The present disclosure relates to computing techniques. Data arrays are processed using Bloom filters to determine aggregate count, maximum, and minimum. These methods can be used on different types of data, including data groups, partial groups, data cubes, hypercubes, and others. | 08-29-2013 |
20130290378 | ADAPTIVE PROBABILISTIC INDEXING WITH SKIP LISTS - A method of indexing in a skip list is disclosed. Key/value pairs are randomly inserted at an appropriate page in a skip list. A new page is created at the lowest level in the skip list. When creating the new page, the page is incremented to a higher level with a write probability. Reading the new page during a search. When reading the new page, the page is incremented to a higher level with a read probability. The read probability is not equal to the write probability. | 10-31-2013 |
20140149433 | Estimating Unique Entry Counts Using a Counting Bloom Filter - A method of estimating a number of unique entry counts of an attribute in a database comprises, with a processor: identifying a sample of entries from an attribute database, determining frequencies of a number of input observations of the sample of entries, determining a number of high frequency values of the sample of entries, and estimating a number of unique entry counts of an attribute within the attribute database using a counting Bloom filter and based on the frequencies of the input observations and the high frequency values. | 05-29-2014 |
20140330768 | INCREMENTALLY UPDATED SAMPLE TABLES - An example apparatus may include a processor and a memory device including computer program code. The memory device and the computer program code may be for, with the processor, causing the apparatus to delete, in a sample table, rows corresponding to a predicate, wherein rows in the sample table are representative of a random sample of rows in a base table of a database; generate sample rows representative of a random sample of rows in the base table corresponding to the predicate; and add the sample rows to the sample table to generate an incrementally updated sample table. | 11-06-2014 |
Patent application number | Description | Published |
20090327055 | Dynamically Rearranging and Deploying Advertising Selection Logic - A method and system for deploying and customizing advertisement selection logic without requiring a shutdown and/or restart of system resources. A first arrangement of advertisement logic may include filters to be executed in a pipeline model. A second arrangement of advertisement selection logic may be determined based at least in part on information received. Alternatively, the second arrangement of advertisement selection logic may be automatic based at least in part on statistics or defined hints. The second arrangement of advertisement selection logic may be implemented using different filters or rearranged filters in an updated pipeline model. | 12-31-2009 |
20090327075 | Optimizing Advertisement Campaign Servicing - Methods, system and computer readable media for distributing advertisements include minimizing storage costs for frequency capping, dividing a set of campaigns into slices and predetermining campaign-target matches. Frequency storage costs may be minimized by storing frequency data for those users or groups of users that have a high probability of exceeding a frequency limit. Additionally or alternatively, a set of campaigns may be divided into slices. Less than all of the slices may then be evaluated (i.e., instead of the entire set) against a user requesting an advertisement. Still further, all campaign-target matches may be evaluated prior to receiving advertisement requests. Re-evaluations may be performed when changes occur to the set of campaigns. The match data may be stored in bitset, hash map and bitmap storage structures. | 12-31-2009 |
20110153644 | METHOD AND APPARATUS FOR UTILIZING A SCALABLE DATA STRUCTURE - An approach is provided for utilizing a scalable data structure. A query specifying an entity identifier and requested content is received. A search is caused, at least in part, the search based on the entity identifier of a profile index of data structures, each specifying a profile field that is associated with an access control field to yield a search result. Access rights to the requested content are indicated for the entity identifier. The data structures further include the profile field and the access control field. | 06-23-2011 |
20110289052 | METHOD AND APPARATUS FOR EVENTUALLY CONSISTENT DELETE IN A DISTRIBUTED DATA STORE - Techniques for effective delete operations in a distributed data store with eventually consistent replicated entries include determining to delete a particular entry from the distributed data store. Each entry includes a first field that holds data that indicates a key and a second field that holds data that indicates content associated with the key and a third field that holds data that indicates a version for the content. The method also comprises causing, at least in part, actions that result in marking the particular entry as deleted without removing the particular entry, and updating a version in the third field for the particular entry. | 11-24-2011 |
20120110150 | METHOD AND APPARATUS FOR UPGRADING COMPONENTS OF A CLUSTER - An approach is provided for upgrading components of a cluster. One or more components of at least one server of a cluster of servers are determined to be upgraded. Status information of the cluster, the at least one server, or a combination thereof is determined. It is determined whether to initiate another upgrade of one or more other components of the at least one server, another one of the servers, or a combination thereof based, at least in part, on the status information. | 05-03-2012 |
20120117067 | METHOD AND APPARATUS FOR PROVIDING A RANGE ORDERED TREE STRUCTURE - An approach is provided for creating a range ordered tree structure. A tree index platform determines one or more ranges for grouping one or more data objects of a key-value store. Next, the tree index platform determines to specify the one or more ranges in one or more respective index objects of a data structure. Then, the tree index platform determines to associate the data structure with the key-value store. | 05-10-2012 |
20120136835 | METHOD AND APPARATUS FOR REBALANCING DATA - An approach is provided for rebalancing data. A backup of at least one database associated with a server is determined. A restoration of the backup to at least one other server is determined to be caused. Routing information to route queries for information stored in the at least one database is determined to be modified to the at least one other server as part of a rebalancing process. | 05-31-2012 |
20130036149 | METHOD AND APPARATUS FOR EXECUTING CODE IN A DISTRIBUTED STORAGE PLATFORM - An approach is provided for creating a framework for executing code in nodes of a distributed storage platform. An in-node code framework receives at least one job for execution over a distributed computing platform. The in-node code framework determines at least one distributed storage platform containing at least a portion of the data for executing the at least one job. The in-node then processes and/or facilitates a processing of the at least one job to determine code for executing at one or more storage nodes of the at least one distributed storage platform, wherein the code supports the at least one job. | 02-07-2013 |
20130150087 | METHOD AND APPARATUS FOR GENERATING REAL-TIME MAP AND LOCATION-BASED DATA - An approach is provided for generating accurate and substantially real-time map and location-based data in a cost-effective manner. Specifically, one or more communications within one or more social networks are monitored, processed, and mined to determine map-related information (e.g., maps, traffic, points of interest). The map-related information is then subjected to one or more threshold criteria (e.g., a correctness probability, a level of confidence, a degree of trust, an author's influence, a rating, or a combination thereof) to better ensure its accuracy before being made available to mapping and/or location-based services that can use the map-related information to develop better quality maps and/or location-based mobile applications (e.g., improved routing guidance, location recommendations, etc.). By providing mapping and location-based services with accurate and real-time map and location-based data, the services can fulfill user's increasing expectation and demand for up-to-the-minute information. | 06-13-2013 |
20140317124 | METHOD AND APPARATUS FOR PROCESSING PROBE DATA - An approach is provided for providing a unified extensible platform for overall probe data and storage. The approach comprises causing, at least in part, a storage of probe data in one or more information spaces, one or more namespaces of the one or more information spaces, or a combination thereof. The approach further comprises determining one or more nodes for processing the probe data based, at least in part, on one or more context criteria, the one or more nodes associated with the one or more information spaces. The approach also comprises determining to provide access to the processed probe data via the one or more information spaces, the one or more namespaces, or a combination thereof. | 10-23-2014 |