Uppala, US
Radhakrishna Uppala, Bellevue, WA US
Patent application number | Description | Published |
---|---|---|
20080306948 | STRING AND BINARY DATA SORTING - A device, system, and method are directed towards sorting a set of string or binary data items. A segment of a fixed size from each data item is combined with a pointer to the data item in a word. The words are sorted, and words having equivalent string/binary segments are grouped together. The groups are recursively sorted until no groups remain or the end of the string or binary data in a group is sorted. Methods of the invention include determining a segment size based on a size of a pointer item and a word size, so that a segment and a pointer fit within a word, allowing comparisons and data manipulation to be performed on words. | 12-11-2008 |
20090077078 | METHODS AND SYSTEMS FOR MERGING DATA SETS - Systems and methods for merging data sets are provided herein. | 03-19-2009 |
20120131022 | METHODS AND SYSTEMS FOR MERGING DATA SETS - Systems and methods for merging data sets are provided. Data sets are merged based upon a process which begins by sorting data sets. Data sets each include at least one data set key column storing at least one data set key column record. The key column record subsets include at least one data set key column record. Based upon the identification of the first and second key column record subsets, a working data set is assembled. The working data set includes at least the first and second key column record subset, a first and second last record indicator corresponding to the last record of the first and second key column record subset respectively, and a first and second position indicator associating the data set key column records with the data sets respectively. The working data set is sorted in accordance with a selected one or more key column record subsets. | 05-24-2012 |
Radha Krishna Uppala, Bellevue, WA US
Patent application number | Description | Published |
---|---|---|
20110016127 | Hierarchy of Servers for Query Processing of Column Chunks in a Distributed Column Chunk Data Store - An improved system and method for query processing in a distributed column chunk data store is provided. A distributed column chunk data store may be provided by multiple storage servers operably coupled to a network. A storage server provided may include a database engine for partitioning a data table into the column chunks for distributing across multiple storage servers, a storage shared memory for storing the column chunks during processing of semantic operations performed on the column chunks, and a storage services manager for striping column chunks of a partitioned data table across multiple storage servers. Query processing may be performed by storage servers or query processing servers operably coupled by a network to storage servers in the column chunk data store. To do so, a hierarchy of servers may be dynamically determined to process execution steps of a query transformed for distributed processing. | 01-20-2011 |
20110055215 | Hierarchy of Servers for Query Processing of Column Chunks in a Distributed Column Chunk Data Store - An improved system and method for query processing in a distributed column chunk data store is provided. A distributed column chunk data store may be provided by multiple storage servers operably coupled to a network. A storage server provided may include a database engine for partitioning a data table into the column chunks for distributing across multiple storage servers, a storage shared memory for storing the column chunks during processing of semantic operations performed on the column chunks, and a storage services manager for striping column chunks of a partitioned data table across multiple storage servers. Query processing may be performed by storage servers or query processing servers operably coupled by a network to storage servers in the column chunk data store. To do so, a hierarchy of servers may be dynamically determined to process execution steps of a query transformed for distributed processing. | 03-03-2011 |
20120060049 | SYSTEM AND METHOD FOR REMOVING A STORAGE SERVER IN A DISTRIBUTED COLUMN CHUNK DATA STORE - Assuring recovery from failure of a storage server in a distributed column chunk data store of operably coupled storage servers, includes: partitioning a data table into chunks; implementing a distribution scheme with a specified level of redundancy for recovery of one or more failed servers among multiple storage servers; distributing the column chunks according to the distribution scheme; calculating column chunk parity; storing the calculated column chunk parity; managing metadata for the column chunk data store; and updating the metadata for distributing the column chunks among remaining storage servers upon receiving an indication to remove a storage serve. | 03-08-2012 |
Radha Krishna Uppala, Belleveu, WA US
Patent application number | Description | Published |
---|---|---|
20090287743 | SYSTEM AND METHOD FOR REMOVING A STORAGE SERVER IN A DISTRIBUTED COLUMN CHUNK DATA STORE - An improved system and method for removing a storage server in a distributed column chunk data store is provided. A distributed column chunk data store may be provided by multiple storage servers operably coupled to a network. A storage server provided may include a database engine for partitioning a data table into the column chunks for distributing across multiple storage servers, a storage shared memory for storing the column chunks during processing of semantic operations performed on the column chunks, and a storage services manager for striping column chunks of a partitioned data table across multiple storage servers. Any data table may be flexibly partitioned into column chunks using one or more columns with various partitioning methods. Storage servers may then be removed and column chunks may be redistributed among the remaining storage servers in the column chunk data store. | 11-19-2009 |
Sathyadev Uppala, Whitehouse Station, NJ US
Patent application number | Description | Published |
---|---|---|
20130089010 | METHODS AND APPARATUS FOR SUPPORTING PEER TO PEER COMMUNICATIONS - Methods and apparatus for supporting peer to peer and infrastructure, e.g., cellular, communication in a multimode device which can operate in a cellular system are described. Methods and apparatus for supporting peer to peer devices are also described. Peer to peer communication occurs within a switching time period during which infrastructure signaling does not occur and devices switch between an uplink and a downlink mode of infrastructure operation. The time period set for the switching time period is intentionally set larger, e.g., 10, 50, 100 or even more times larger than that required based on maximum cell size. Thus, a peer to peer communications period can be introduced into a TDD system and use the same frequency band as the TDD system in a manner that can remain compliant with a cellular communications protocol which allows for a switching time period, e.g., set in the system by a parameter. | 04-11-2013 |
Srikanth Uppala, San Diego, CA US
Patent application number | Description | Published |
---|---|---|
20080311940 | ALTERNATE RADIO CHANNEL SELECTION ADAPTED PER USER PATTERNS - Methods, systems, and apparatuses for selecting alternate channels for broadcast radio channels, and for tracking alternate channel selections, are provided. Some radio systems provide alternate frequencies for tuned radio frequencies to use when the tuned radio frequency signal is no longer receivable. In aspects of the present invention, historical information is generated from alternate channel switching attempts. In further aspects, the generated historical information is used to aid in making a subsequent switch to an alternate channel. | 12-18-2008 |
20100233980 | ALTERNATE RADIO CHANNEL SELECTION ADAPTED PER USER PATTERNS - Methods, systems, and apparatuses for selecting alternate channels for broadcast radio channels, and for tracking alternate channel selections, are provided. Some radio systems provide alternate frequencies for tuned radio frequencies to use when the tuned radio frequency signal is no longer receivable. In aspects of the present invention, historical information is generated from alternate channel switching attempts. In further aspects, the generated historical information is used to aid in making a subsequent switch to an alternate channel. | 09-16-2010 |
Sudhaker Uppala, Edison, NJ US
Patent application number | Description | Published |
---|---|---|
20100217772 | COMMODITIES FRAMEWORK - Various embodiments are directed to methods and systems for presenting an interface to a user. For example, a computer may receive a request for content originating from a browser application executing on a client machine in electronic communication with the at least one server. The request may identify a first commodity and a first event associated with the commodity and may comprise a Universal Resource Locator (URL) identifying the first commodity. The computer may parse a commodity descriptor file to identify a first service associated with the first commodity and the first event. The commodity descriptor file may comprise definitions of a plurality of commodities and wherein the plurality of commodities comprises the first commodity. In addition, the computer may generate a service call requesting the first service, and execute the at least one service associated with the first commodity and the first event. The at least one service may query the data source to retrieve data describing the commodity and construct a model of the commodity according to the data. | 08-26-2010 |