Patent application number | Description | Published |
20090006399 | COMPRESSION METHOD FOR RELATIONAL TABLES BASED ON COMBINED COLUMN AND ROW CODING - A robust method to compress relations close to their entropy while still allowing efficient queries. Column values are encoded into variable length codes to exploit skew in their frequencies. The codes in each tuple are concatenated and the resulting tuplecodes are sorted and delta-coded to exploit the lack of ordering in a relation. Correlation is exploited either by co-coding correlated columns, or by using a sort order that can leverage the correlation. Also presented is a novel Huffman coding scheme, called segregated coding, that preserves maximum compression while allowing range and equality predicates on the compressed data, without even accessing the full dictionary. Delta coding is exploited to speed up queries, by reusing computations performed on nearly identical records. | 01-01-2009 |
20090174583 | Method for Compressed Data with Reduced Dictionary Sizes by Coding Value Prefixes - The speed of dictionary based decompression is limited by the cost of accessing random values in the dictionary. If the size of the dictionary can be limited so it fits into cache, decompression is made to be CPU bound rather than memory bound. To achieve this, a value prefix coding scheme is presented, wherein value prefixes are stored in the dictionary to get good compression from small dictionaries. Also presented is an algorithm that determines the optimal entries for a value prefix dictionary. Once the dictionary fits in cache, decompression speed is often limited by the cost of mispredicted branches during Huffman code processing. A novel way is presented to quantize Huffman code lengths to allow code processing to be performed with few instructions, no branches, and very little extra memory. Also presented is an algorithm for code length quantization that produces the optimal assignment of Huffman codes and show that the adverse effect of quantization on the compression ratio is quite small. | 07-09-2009 |
20090193053 | INFORMATION MANAGEMENT SYSTEM - A method is disclosed for authoring a knowledge base of semi-structured data comprising the steps of providing at least one knowledge entry in said knowledge base, said knowledge entries having mutable informational content associated therewith, defining a schema associated with said knowledge base, said schema having a plurality of hierarchical namespaces, creating a new assignment, said new assignment being defined by a prefix of at least one of said hierarchical namespaces, whereby said namespace is associated with said new assignment; and associating at least one of said knowledge entries with said new assignment by mapping said at least one knowledge entry into one of said hierarchical namespaces associated with said new assignment. | 07-30-2009 |
20100318640 | ADAPTIVE WRITE-BACK AND WRITE-THROUGH CACHING FOR OFF-LINE DATA - A method for facilitating communication between an application and a server is provided. An intermediary sits between an application and a server. The intermediary intercepts and responds to communications on behalf of the intended recipient of the communication. | 12-16-2010 |
20100319054 | PORTABLE EMBEDDED LOCAL SERVER FOR WRITE-THROUGH CACHE - A method of facilitating, via an embedded local server, dynamic responses to requests originating from an application and directed to a server is disclosed. An intermediary intercepts requests responds to the requests with locally stored data. The intermediary may also forward requests to an embedded local server for processing based on local data. | 12-16-2010 |
20140033223 | LOAD BALANCING USING PROGRESSIVE SAMPLING BASED ON LOAD BALANCING QUALITY TARGETS - A method, system, and computer program product for of load balancing in a parallel map/reduce paradigm. The method commences by sampling a first set of input records, and forming a prospective load balancing assignment by assigning the first set of input records to the plurality of worker tasks based on a workload estimate for each of the worker tasks. To measure the prospective load balancing assignment, the method compares the workload variance over the plurality of worker tasks to a workload variance target, and also calculates a confidence level based on the sampled first set of input records. If the measured quality of the prospective load balancing assignment is not yet achieved, then the method samples additional input records; for example when the calculated workload variance is greater than the maximum workload variance target or when the calculated confidence level is lower than a confidence level threshold. | 01-30-2014 |
20140040310 | QUERY-LEVEL ACCESS TO EXTERNAL PETABYTE-SCALE DISTRIBUTED FILE SYSTEMS - A system to implement query-level access by a database engine to an external distributed file system by identifying a results file location of one or more results files on the external distributed file system, and storing the results file locations in external table files on the database engine for subsequent use during retrieval of data from the results files. The database engine serves to process queries where the query specifies the external table (which in turn references locations of the results files). Execution of the query streams data from the external distributed file system into the database engine. The data from the external distributed file system is not stored in the external table files on the database engine; rather, the external table files specify a location of code or operational directives which, when executed, streams results from the external distributed file system to at least one parallel query engine. | 02-06-2014 |
Patent application number | Description | Published |
20100042587 | Method for Laying Out Fields in a Database in a Hybrid of Row-Wise and Column-Wise Ordering - A method, system, and article are provided for employment of a hybrid layout of representation of data objects in computer memory. Columns of the database are separated based upon a classification of the columns. A vertical partition in the form of a bank is provided to receive an assignment of one or more data objects identified in the columns. Each bank is sized to be a divisor of a size of an associated hardware register. Assignment of data objects to banks organizes the data in a manner that support efficient query processing that mitigates the quantity of banks required to respond to the query. | 02-18-2010 |
20120089735 | Two-Level Management of Locks on Shared Resources - In a shared data system comprising one or more primary nodes and a plurality of secondary nodes, global lock manager on a primary node manages locks for shared resources by exchanging an abstract lock state with local lock managers on the secondary nodes. The abstract lock state includes a particular representation of all of the applications on the nodes that are requesting or are granted locks. The exchange of these particular lock states instead of individual requests improves performance by increasing concurrency and reducing off-machine communication. A global deadlock detector on a node detects and resolves global deadlocks, in conjunction with local deadlock detectors on the secondary nodes. | 04-12-2012 |
20120166404 | REAL-TIME TEXT INDEXING - Systems, methods, and other embodiments associated with real-time text indexing are described. One example method includes receiving a document for indexing in a search system that includes a mature index and indexing the received document in a staging index. The staging index may be stored in direct access memory associated with query processing that does not degrade query performance even when postings become fragmented. The staging index and the mature text index are accessed to process queries on the search system. The example method may also include periodically merging the staging index into the mature index based on query feedback. | 06-28-2012 |
20140032765 | Two-Level Management of Locks on Shared Resources - In a shared data system comprising one or more primary nodes and a plurality of secondary nodes, global lock manager on a primary node manages locks for shared resources by exchanging an abstract lock state with local lock managers on the secondary nodes. The abstract lock state includes a particular representation of all of the applications on the nodes that are requesting or are granted locks. The exchange of these particular lock states instead of individual requests improves performance by increasing concurrency and reducing off-machine communication. A global deadlock detector on a node detects and resolves global deadlocks, in conjunction with local deadlock detectors on the secondary nodes. | 01-30-2014 |
20140095468 | HARDWARE FOR TABLE SCAN ACCELERATION - Techniques for processing a query are provided. One or more operations that are required to process a query are performed by a coprocessor that is separate from a general purpose microprocessor that executes query processing software. The query processing software receives a query, determines one or more operations that are required to be executed to fully process the query, and issues one or more commands to one or more coprocessors that are programmed to perform one of the operations, such as a table scan operation and/or a lookup operation. The query processing software obtains results from the coprocessor(s) and performs one or more additional operations thereon to generate a final result of the query. | 04-03-2014 |
20140095534 | SEMI-JOIN ACCELERATION - Techniques for processing a query are provided. One or more operations that are required to process a query are performed by a coprocessor that is separate from a general purpose microprocessor that executes query processing software. The query processing software receives a query, determines one or more operations that are required to be executed to fully process the query, and issues one or more commands to one or more coprocessors that are programmed to perform one of the operations, such as a table scan operation and/or a lookup operation. The query processing software obtains results from the coprocessor(s) and performs one or more additional operations thereon to generate a final result of the query. | 04-03-2014 |
20140095748 | RECONFIGURABLE HARDWARE STRUCTURES FOR FUNCTIONAL PIPELINING OF ON-CHIP SPECIAL PURPOSE FUNCTIONS - A method and apparatus for reconfiguring hardware structures to pipeline the execution of multiple special purpose hardware implemented functions, without saving intermediate results to memory, is provided. Pipelining functions in a program is typically performed by a first function saving its results (the “intermediate results”) to memory, and a second function subsequently accessing the memory to use the intermediate results as input. Saving and accessing intermediate results stored in memory incurs a heavy performance penalty, requires more power, consumes more memory bandwidth, and increases the memory footprint. Due to the ability to redirect the input and output of the hardware structures, intermediate results are passed directly from one special purpose hardware implemented function to another without storing the intermediate results in memory. Consequently, a program that utilizes the method or apparatus, reduces power consumption, consumes less memory bandwidth, and reduces the program's memory footprint. | 04-03-2014 |
20140095805 | REMOTE-KEY BASED MEMORY BUFFER ACCESS CONTROL MECHANISM - A system and method implementing revocable secure remote keys is disclosed. A plurality of indexed base secrets is stored in a register of a coprocessor of a local node coupled with a local memory. When it is determined that a selected base secret expired, the base secret stored in the register based on the base secret index is changed, thereby invalidating remote keys generated based on the expired base secret. A remote key with validation data and a base secret index is received from a node requesting access to the local memory. A validation base secret is obtained from the register based on the base secret index. The coprocessor performs hardware validation on the validation data based on the validation base secret. Hardware validation fails if the base secret associated with the base secret index has been changed in the register of the selected coprocessor. | 04-03-2014 |
20140096145 | HARDWARE MESSAGE QUEUES FOR INTRA-CLUSTER COMMUNICATION - A method and apparatus for sending and receiving messages between nodes on a compute cluster is provided. Communication between nodes on a compute cluster, which do not share physical memory, is performed by passing messages over an I/O subsystem. Typically, each node includes a synchronization mechanism, a thread ready to receive connections, and other threads to process and reassemble messages. Frequently, a separate queue is maintained in memory for each node on the I/O subsystem sending messages to the receiving node. Such overhead increases latency and limits message throughput. Due to a specialized coprocessor running on each node, messages on an I/O subsystem are sent, received, authenticated, synchronized, and reassembled at a faster rate and with lower latency. Additionally, the memory structure used may reduce memory consumption by storing messages from multiple sources in the same memory structure, eliminating the need for per-source queues. | 04-03-2014 |
20150019739 | TWO-LEVEL MANAGEMENT OF LOCKS ON SHARED RESOURCES - In a shared data system comprising one or more primary nodes and a plurality of secondary nodes, global lock manager on a primary node manages locks for shared resources by exchanging an abstract lock state with local lock managers on the secondary nodes. The abstract lock state includes a particular representation of all of the applications on the nodes that are requesting or are granted locks. The exchange of these particular lock states instead of individual requests improves performance by increasing concurrency and reducing off-machine communication. A global deadlock detector on a node detects and resolves global deadlocks, in conjunction with local deadlock detectors on the secondary nodes. | 01-15-2015 |
Patent application number | Description | Published |
20090248648 | METHOD FOR EVALUATING A CONJUNCTION OF EQUITY AND RANGE PREDICATES USING A CONSTANT NUMBER OF OPERATIONS - Methods are described to simultaneously apply conjugates of equality, range, and in-list predicates. A first set of methods are described for the simultaneous application of equality predicates. A second set of methods are described for the simultaneous application of a mixture of range and equality predicates. A third method is described for the simultaneous applying a mixture of in-list predicates. The described methods allow for quick evaluation of complex predicates as they efficiently implement the computation done per record, while maintaining the same execution time irrespective of the number of fields. | 10-01-2009 |
20090248699 | SYSTEM TO DELEGATE VIRTUAL STORAGE ACCESS METHOD RELATED FILE OPERATIONS TO A STORAGE SERVER USING AN IN-BAND RPC MECHANISM - A method is disclosed that places data-intensive subprocesses in close physical and logical proximity to the facility responsible for storing the data, so that high efficiencies at reduced cost are achieved. In one specific example, new computer programs, termed adjuncts, are added and placed in a logical partition on a storage facility so that they can be invoked using appropriate commands issued on the I/O channel. Further, programs or changes are added to existing programs on the host machine, wherein such programs or changes discover the function extensions and invoke them to perform data processing. | 10-01-2009 |
20090249023 | APPLYING VARIOUS HASH METHODS USED IN CONJUNCTION WITH A QUERY WITH A GROUP BY CLAUSE - A novel method is described for applying various hash methods used in conjunction with a query with a Group By clause. A plurality of drawers are identified, wherein each of the drawers is made up of a collection of cells from a single partition of a Group By column and each of the drawers being defined for a specific query. A separate hash table is independently computed for each of the drawers and a hashing scheme (picked from among a plurality of hashing schemes) is independently applied for each of the drawers. | 10-01-2009 |
20090254521 | FREQUENCY PARTITIONING: ENTROPY COMPRESSION WITH FIXED SIZE FIELDS - A frequency partitioning technique is introduced that amortizes the work of computing codeword lengths within a tuplecode by grouping together tuples that have the same pattern of codeword lengths. Specifically, the technique entropy codes and partitions column values in each column into disjoint sets called column partitions, assigns a codeword length to each of the column partitions, identifies cells (a combination of codeword lengths), and collectively storing tuples associated with each of the cells. | 10-08-2009 |
20100030594 | Method for User Driven Multi-objective Optimization of Travel Plans - The invention is a travel planning system that treats travel planning as a multi-objective optimization problem and allows the one or more users to optimize itineraries through an iterative process of selecting new destinations by a greedy process that encourages the adding of destinations that taken one at a time add minimally to the cost and maximally to the benefit of the itinerary and a competitive process of comparing potential itinerary changes on multiple benefit axes. | 02-04-2010 |
20100049730 | EFFICIENT PREDICATE EVALUATION VIA IN-LIST - A predicate over a single column of a table is converted into at least one IN-list, wherein the IN-list is generated for a set of tuples of the column, and the generation is done over a data structure representing a set of distinct values of the column where the predicate applies and having a smaller cardinality than the table. The generated IN-list is evaluated over the set of tuples and the results of the evaluation are outputted as an evaluation of the predicate. | 02-25-2010 |
Patent application number | Description | Published |
20130017806 | INTELLIGENT PARENTAL CONTROLS FOR WIRELESS DEVICESAANM SPRIGG; Stephen A.AACI PowayAAST CAAACO USAAGP SPRIGG; Stephen A. Poway CA USAANM SWART; HugoAACI San DiegoAAST CAAACO USAAGP SWART; Hugo San Diego CA USAANM JAMES; R. MichaelAACI San MateoAAST CAAACO USAAGP JAMES; R. Michael San Mateo CA US - Methods, systems and devices for controlling mobile device functions via a combination of parental control settings set by a parent-user and parental control settings set by a third party-user. A parental control server receives parental control settings and context criteria from a parent-user, and parental control settings from a third party user. The parental control server receives authorization from the parent-user to allow third party parental controls to control a child's device. When the context criteria identified by the parent is present (e.g., child device is in identified location, time of day, day of week, etc.), a combination of parental controls designated by the parent-user and the third party control the mobile device. | 01-17-2013 |
20130040604 | CONTROLLING TEXT MESSAGES ON A MOBILE DEVICE - Methods, systems and devices for controlling access to messaging (SMS, MMS, email, etc.) on mobile devices (e.g., cell phones) during times or in locations in which such activity is prohibited or inhibited by the parental control settings. Parental control settings limit messaging features available to mobile devices to certain times and/or locations. Messages received at restricted times/locations are stored in temporary memory without notifying the mobile device user (i.e., messages are not placed in the inbox), unless the message is received from a pre-approved source (e.g., parent, teachers, etc.). Once the context for restricting access to messaging (e.g., time, location, etc.) no longer applies, the stored messages may be transferred from the temporary memory to the inbox and the user may be alerted regarding the new message. | 02-14-2013 |
20130040629 | WEB-BASED PARENTAL CONTROLS FOR WIRELESS DEVICES - Methods, systems and devices to dynamically generate community based parental controls for cell devices based on most common parental control settings selected by members of the community. Communities may establish sponsored profiles on a parental control server that contains a community-based set of parental control settings. Parents may select a community based setting and modify each of the settings in accordance with the parents' personal preferences. The parental control server continually monitors the modifications to those settings and generates new community-based settings reflecting the most common modifications that may be selected by other parents. | 02-14-2013 |
20130047229 | PLAY TIME DISPENSER FOR ELECTRONIC APPLICATIONS - Systems, methods, devices, and computer program products are described for controlling access to electronic applications by a user. A request may be received (e.g., from a user) to access an electronic application. The availability of points, credits, or time for the particular user may be determined, and access to the electronic application granted or denied based on the determination. User identity may be verified through biometric data, with such verification repeated at periodic or random intervals. Access may be restricted based on a permission level of a particular authority that has responsibility for all or a portion of the user's activities during a particular time period. Access may also be restricted based on the location of the user at the time of the access request. | 02-21-2013 |
20130047260 | COLLABORATIVE CONTENT RATING FOR ACCESS CONTROL - Methods, systems, devices, and computer program products are described for controlling access to electronic content. Content ratings for electronic content are received from each of a number of reviewers, and the input value for each of the reviewers is weighted. Content analysis for the electronic content is also received on each of a number of factors, and each factor is weighted. These weightings may be based on community standards, be specific to a geographic region, or be personalized. The weighted content ratings and the weighted content analysis may be combined to generate an access metric. Access to the electronic content may be controlled based on the access metric. | 02-21-2013 |
Patent application number | Description | Published |
20100197176 | FLAT PLUNGER ROUND BARREL TEST PROBE - A spring probe utilizing a flat plunger and a round barrel having a compression spring positioned within the barrel and a wiper for internal contact between the plunger and the inside of the barrel. | 08-05-2010 |
20100244875 | SCRUB INDUCING COMPLIANT ELECTRICAL CONTACT - The contact assembly having a contact member with a contact tip positioned within holes in a test socket or probe plate wherein the contact tip or the hole in the probe plate or test socket has a cam surface to provide lateral movement of the contact tip across a surface of a test location during compression of the contact member to induce scrubbing on the surface of the test site. | 09-30-2010 |
20100267291 | SWAGING PROCESS FOR IMPROVED COMPLIANT CONTACT ELECTRICAL TEST PERFORMANCE - A spring contact assembly having a first plunger with a tail portion having a flat contact surface and a swagable surface and a second plunger having a tail portion with a flat contact surface and a swagable surface wherein the flat contact surfaces are overlapping and are surrounded by an external compression spring such that the swagable surfaces are swaged by the coils of the spring during the initial compression of the spring. | 10-21-2010 |
20110148451 | WIRING BOARD FOR TESTING LOADED PRINTED CIRCUIT BOARD - A wiring board for transmission of test signals between test point locations on a circuit board under test and an external analyzer having compliant contacts making electrical contact with a pad positioned on a conductive surface circuit layer having a trace extending to a second pad having a hole for receipt of an interface pin electrically connected to the external analyzer. | 06-23-2011 |
20110175636 | TERMINAL FOR FLAT TEST PROBE - A terminal end for a flat test probe having tapered cam surfaces providing a lead-in angle on the tail of the terminal end which extend to a sharp rear angle to engage detents or projections within a receptacle. The tapered cam surfaces and shape rear angles allow the probe to be inserted into the receptacle with minimal force to retain the flat test probe within the receptacle. | 07-21-2011 |
20130069685 | INTEGRATED CIRCUIT TEST SOCKET HAVING TEST PROBE INSERTS - A test socket having a lid and a base with a cavity for receipt of an integrated circuit and removable test probe inserts having test probes positioned around a perimeter of the cavity. | 03-21-2013 |
20150054539 | WIRING BOARD FOR TESTING LOADED PRINTED CIRCUIT BOARD - A wiring board for transmission of test signals between test point locations on a circuit board under test and an external analyzer having compliant contacts making electrical contact with a pad positioned on a conductive surface circuit layer having a trace extending to a second pad having a hole for receipt of an interface pin having a swaged head electrically connected to the external analyzer. | 02-26-2015 |