For Parallel Processing System Patents (Class 707/764)
-
Patent number: 8443366Abstract: In accordance with embodiments, there are provided techniques for establishing a parallel processing framework in a multi-tenant on-demand database system. These techniques for establishing a parallel processing framework in a multi-tenant on-demand database system may enable embodiments to provide great flexibility to a tenant of the architecture to perform desired functions on content of the database without unduly consuming the resources of the system.Type: GrantFiled: December 11, 2009Date of Patent: May 14, 2013Assignee: salesforce.com, inc.Inventor: Scott Yancey
-
Publication number: 20130110860Abstract: A query pipeline for an enterprise search system is configurable by a user of the system. A user may create rules for custom query transformation and parallel query generation, federation of queries, mixing of results and application of display layouts to the received search results. A user interface (UI) assists a user in configuring the search pipeline. For example, a user may enter condition action rules for queries that affect how a query is transformed, how parallel queries are generated, how queries are federated, how search results are ranked and displayed, how rules are ordered and the like.Type: ApplicationFiled: November 2, 2011Publication date: May 2, 2013Applicant: MICROSOFT CORPORATIONInventors: Viktoriya Taranov, Pedro Dantas DeRose, Victor Poznanski, Yauhen Shnitko, Puneet Narula, Dmitriy Meyerzon
-
Patent number: 8412725Abstract: A method for processing, in a platform having one or more processors and memories, an object including elementary information of same type. The method decomposes the object to be processed into at least two sub-objects of N elementary information each, all the sub-objects having the same quantity N of elementary information, the processing performing at least one sequence of specific operations on the elementary information of each sub-object performing, for each sub-object, at least N times each specific operation, such that each elementary information for each sub-object is applied at least one time, and N results are produced for each specific operation, the sequence of specific operations being such that at least one specific operation of the sequence produces, at least once during its N applications, a result used for the processing of another sub-object.Type: GrantFiled: December 19, 2006Date of Patent: April 2, 2013Assignee: DXO LabsInventor: Bruno Liege
-
Patent number: 8407239Abstract: A multi-stage query processing system and method enables multi-stage query scoring, including “snippet” generation, through incremental document reconstruction facilitated by a multi-tiered mapping scheme. At one or more stages of a multi-stage query processing system a set of relevancy scores are used to select a subset of documents for presentation as an ordered list to a user. The set of relevancy scores can be derived in part from one or more sets of relevancy scores determined in prior stages of the multi-stage query processing system. In some embodiments, the multi-stage query processing system is capable of executing one or more passes on a user query, and using information from each pass to expand the user query for use in a subsequent pass to improve the relevancy of documents in the ordered list.Type: GrantFiled: August 13, 2004Date of Patent: March 26, 2013Assignee: Google Inc.Inventors: Jeffrey Adgate Dean, Paul G. Haahr, Olcan Sercinoglu, Amitabh K. Singhal
-
Patent number: 8407206Abstract: Described herein are methods and systems for providing software development services more efficiently. Re-computation of results each time a service request is received can be avoided by maintaining a cache of results from having processed requests. Results are stored under a unique mapping of request-results pairs that at least in part rely on a file fingerprint hash of the contents of the input files related to the request. In network environment with a client requester and service provider unnecessary transmission is also avoided by first presenting results for requests are in form of a unique file identifier identifying one or more files holding the content of the results. The file identifier is used to search a cache local to the requesting client prior to requesting transmission of the results. The file identifier may also include an indicator for indicating a location from which the results may be retrieved.Type: GrantFiled: May 16, 2005Date of Patent: March 26, 2013Assignee: Microsoft CorporationInventors: Todd A. Proebsting, David R. Hanson, Benjamin G. Zorn
-
Patent number: 8386508Abstract: A method and system for parallel query processing is provided. The method includes estimating a number of sub-queries that may be formed corresponding to an input query. The method further includes fragmenting the input query into a plurality of sub queries by adding one or more filter predicates to the input query without altering the semantics of the input query. Further, processing of the sub queries is scheduled. Thereafter, one or more query execution plans are generated and processed. Following the processing of the query execution plans, the results of the processed sub queries are collated, aggregated and presented in a required format.Type: GrantFiled: April 28, 2009Date of Patent: February 26, 2013Assignee: Infosys Technologies LimitedInventors: Srikumar Krishnamoorthy, Shanmugavel Sadasivam, Aakanksha Gagrani, Prahalad Haldhoderi Achutharao
-
Patent number: 8380730Abstract: Techniques are disclosed for invoking an analysis routine running on a parallel computer system to analyze query results. An interface used to build and execute a database query may be used to invoke a complex analysis routine on a parallel computer system to analyze query results obtained by executing the database query. Alternatively, a user may build a query that includes specific conditions evaluated by an analysis routine on the parallel computer system (as opposed to selecting an analysis routine after receiving query results).Type: GrantFiled: October 9, 2008Date of Patent: February 19, 2013Assignee: International Business Machines CorporationInventors: Richard D Dettinger, Mark G Megerian, Amanda Peters
-
Patent number: 8375047Abstract: A shared nothing distributed database system includes a master node and a set of shared nothing nodes. Each shared nothing node includes a node state table stored in memory that characterizes various statements and multiple processes implementing each statement, target resource consumption rate for each process and process activity information. A monitor module executed by a central processing unit processes information in the node state table and adjusts values in the node state table in accordance with priority criteria specifying individual user priority ascribed to a statement. A query associated with a statement is processed in the shared nothing distributed database system in accordance with the priority criteria.Type: GrantFiled: March 31, 2010Date of Patent: February 12, 2013Assignee: EMC CorporationInventors: Sivaramakrishnan Narayanan, Florian Michael Waas
-
Publication number: 20130007033Abstract: Providing answers to questions based on any corpus of data implements a method that generates a number of candidate passages from the corpus that answer an input query, and finds the correct resulting answer by collecting supporting evidence from the multiple passages. By analyzing all retrieved passages and that passage's metadata in parallel, an output plurality of data structures is generated including candidate answers based upon the analyzing. Then, supporting passage retrieval operations are performed upon the set of candidate answers, and for each candidate answer, the data corpus is traversed to find those passages having candidate answer in addition to query terms. All candidate answers are automatically scored by a plurality of scoring modules, each producing a module score. The modules scores are processed to determine one or more query answers; and, a query response is generated based on the one or more query answers.Type: ApplicationFiled: September 12, 2012Publication date: January 3, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Eric W. Brown, David Ferrucci, Adam Lally, Wlodek W. Zadrozny
-
Patent number: 8296271Abstract: A method and system for data recovery in a parallel database system in which data stored in the database has been corrupted by a transaction or operation. Transaction log files corresponding to each node of the parallel database are scanned to determine an operation that caused the corruption of the stored data. Information corresponding to the corrupted data before the operation causing the corruption is then generated based on the scanned transaction log. The operation responsible for corrupting the data is then rolled back, and the corrupted data is replaced with the original data stored in the database prior to the corruption.Type: GrantFiled: March 28, 2005Date of Patent: October 23, 2012Assignee: Federal Home Loan Mortgage CorporationInventors: Craig Patrick Richardson, James Wesley Seaman, Elizabeth Marie Charboneau
-
Patent number: 8296313Abstract: A method for controlling a relational database system, with a query statement comprised of keywords being analyzed, with the RTN being formed of independent RTN building blocks. Each RTN building block has an inner, directed decision graph which is defined independently from the inner, directed decision graphs of the other RTN building blocks with at least one decision position along at least one decision path. The inner decision graphs of all RTN building blocks are run by means of the keywords in a selection step and all possible paths of this decision graph are followed until either no match with the respectively selected path is determined by the decision graph and the process is interrupted, or the respectively chosen path is run until the end.Type: GrantFiled: June 7, 2010Date of Patent: October 23, 2012Assignee: Mediareif Moestl & Reif Kommunikations-und Informationstechnologien OEGInventor: Matthias Moestl
-
Patent number: 8266172Abstract: A method of analyzing a data parallel query includes receiving a user-specified data parallel query that includes a plurality of query operators. An operator type for each of the query operators is identified based on a type of parallel input data structure the operator operates on and a type of parallel output data structure the operator outputs. It is determined whether the query is a prohibited query based on the identified operator types.Type: GrantFiled: April 3, 2009Date of Patent: September 11, 2012Assignee: Microsoft CorporationInventors: Igor Ostrovsky, John Duffy, Mike Liddell, Edward G. Essey, Stephen H. Toub
-
Patent number: 8260801Abstract: A system for parallel flow-awared pattern matching and a method thereof for performing distributed detection for incoming flows are provided. The system includes a pattern-set-partitioner for partitioning a pattern set for pattern matching into a number of pattern subsets in advance, a plurality of pattern matching engines, and a scheduler. The pattern matching engines each perform pattern matching for the incoming flows. The scheduler selects a number of pattern matching engines equal to the number of the partitioned pattern subsets from all the pattern matching engines and allocates pattern matching tasks, each performing flow matching against one pattern subset, to the selected pattern matching engines. With the system and method of the present invention, distributed detection can be performed by partitioning rules/pattern set to realize load-balancing parallel flow-awared pattern matching.Type: GrantFiled: April 25, 2008Date of Patent: September 4, 2012Assignee: International Business Machines CorporationInventors: Bo Feng, Hong Bin Lu, Kai Zheng
-
Patent number: 8255411Abstract: The present invention includes systems and methods for retrieving information via a flexible and consistent targeted search model that employs interactive multi-prefix, multi-tier and dynamic menu information retrieval techniques that provide context-specific functionality tailored to particular information channels, as well as to records within or across such channels, and other known state information. Users are presented with a consistent search interface among multiple tiers across and within a large domain of information sources, and need not learn different or special search syntax. A thin-client server-controlled architecture enables users of resource-constrained mobile communications devices to locate targeted information more quickly by entering fewer keystrokes and performing fewer query iterations and web page refreshes, which in turn reduces required network bandwidth.Type: GrantFiled: November 17, 2009Date of Patent: August 28, 2012Assignee: Boopsie, Inc.Inventors: G. Gregory Carpenter, Timothy L. Kay
-
Patent number: 8234292Abstract: A system, method, and computer-readable medium for optimized processing of queries that feature maximum or minimum equality conditions are provided. A table on which the query is applied is scanned a single time. Rows of the table distributed to respective processing modules are scanned by the processing modules. Each processing module maintains identification of any rows distributed to the respective processing module that have attribute values that equal the maximum or minimum attribute value locally identified by the processing module. Subsequently, a global aggregation mechanism is invoked to compute the query result without requiring an additional rescan of the table. Further, the disclosed mechanisms may be extended to compute top N queries featuring maximum or minimum equality conditions.Type: GrantFiled: December 11, 2008Date of Patent: July 31, 2012Assignee: Teradata US, Inc.Inventors: Yu Xu, Olli Pekka Kostamaa
-
Patent number: 8234260Abstract: A method for metadata management for scalable processes, involving creating a process by a first home processor, wherein the process is associated with a process identification (ID), storing the processor ID and information identifying the first home processor in a global process look-up data structure (GPLD), requesting metadata associated with the process, searching the GPLD to obtain the first home processor of the process using the process ID, and retrieving the metadata associated with the process from the first home processor.Type: GrantFiled: June 22, 2005Date of Patent: July 31, 2012Assignee: Oracle America, Inc.Inventors: Yuguang Wu, Christopher A. Vick, Michael H. Paleczny, Olaf Manczak, Jay R. Freeman, Phyllis E. Gustafson
-
Patent number: 8229946Abstract: A business rules application parallel processing system is provided. The system comprises at least one computer system, stored data, and an application that, when executed on the at least one computer system, extracts data from the initially stored data for processing in accordance with at least one business rule. The system also stores the data in a sequential file format as a first data set and partitions the data in the first data set in accordance with the at least one business rule to create a second data set and prepare the data in the second data set for processing. The system also partitions the data in the second data set into partition units appropriate for scaled application processing across multiple processors in the at least one computer system to create a third data set. The system also processes the data in the third data set in a parallel execution across the multiple processors and recombines the data after processing in accordance with the at least one business rule in a fourth data set.Type: GrantFiled: January 26, 2009Date of Patent: July 24, 2012Assignee: Sprint Communications Company L.P.Inventor: Keith Alan Crane
-
Patent number: 8229945Abstract: A distributed database system has multiple compute nodes each running an instance of a database management system (DBMS) program that accesses database records in a local buffer cache. Records are persistently stored in distributed flash memory on multiple storage nodes. A Sharing Data Fabric (SDF) is a middleware layer between the DBMS programs and the storage nodes and has API functions called by the DBMS programs when a requested record is not present in the local buffer cache. The SDF fetches the requested record from flash memory and loads a copy into the local buffer cache. The SDF has threads on a home storage node that locate database records using a node map. A global cache directory locks and pins records to local buffer caches for updating by a node's DBMS program. DBMS operations are grouped into transactions that are committed or aborted together as a unit.Type: GrantFiled: November 24, 2008Date of Patent: July 24, 2012Assignee: Schooner Information Technology, Inc.Inventors: Darpan Dinker, Andrew David Eckhardt, Darryl Manabu Ouye, Brian Walter O'Krafka, Earl T. Cohen, Thomas M. McWilliams
-
Patent number: 8224812Abstract: A database management system has a query interface for receiving a query and a query executor for executing the received query. The query executor dynamically generates a task, and executes a plurality of tasks in parallel. In execution of each task, each time data is required to be read from a database, the query executor generates a task for acquiring the data, and in execution of the generated task, issues a data read request for reading the data from the database, to thereby shorten a time taken to execute each task.Type: GrantFiled: September 15, 2011Date of Patent: July 17, 2012Assignee: Masaru KitsuregawaInventors: Masaru Kitsuregawa, Kazuo Goda
-
Patent number: 8200686Abstract: A look up engine 200 comprising a storage means 212a, 212b for storing a plurality of entries, each entry comprising a value and an associated key value, such that, in operation, a look up is carried out by outputing a value which is associated with the stored key value which matches an input key value. The look up engine 200 comprises a plurality of look up state machines 206a, 206b, 206c, 206d connected in parallel to enable multiple look ups to be carried out concurrently. Each entry comprises an associated skip value, if the skipped bits of the input key value and the associated skip value mismatches, an error message is output to indicate lookup failure. The entries may be stored in a trie format which is constructed by identifying overlapping ranges between the plurality of entries; splitting the identified overlapping ranges; storing the plurality of entries within a trie structure.Type: GrantFiled: June 14, 2005Date of Patent: June 12, 2012Assignee: Rambus Inc.Inventor: John Rhoades
-
Patent number: 8195682Abstract: A topographical analysis system that provides an integrated approach for gathering available topographical data and synthesizing the topographical data for various uses by various users. The topographical data may be real time data, historical data, and/or most recent data. The processing of the data utilizes cloud resources in a cloud computing architecture. In addition, cloud resources are utilized to store various accumulated topographical data in a manner such that the cloud resources can quickly process calculations and return results to an end user requesting certain data.Type: GrantFiled: August 29, 2008Date of Patent: June 5, 2012Assignee: Empire Technology Development LLC.Inventors: Gene Fein, Edward Merritt
-
Patent number: 8190624Abstract: A parallel execution of a query is performed with a plurality of producers using a partitioned data source, thereby producing output data. The output data is consumed with at least one consumer. The at least one consumer is monitored. A determination is made whether to stop producing output data by at least one of the producers prior to completion of the execution of the query based on the monitoring.Type: GrantFiled: November 29, 2007Date of Patent: May 29, 2012Assignee: Microsoft CorporationInventors: John Duffy, Edward G. Essey, Charles D. Callahan, II
-
Publication number: 20120109992Abstract: Techniques are provided for rewriting queries during a database query processing operation to include auxiliary attributes not included in the original query, thus improving processing efficiency. For example, a technique for rewriting a query in a query processing operation includes the following steps. The query is processed in accordance with at least a portion of a data set, producing query results. Data attributes from the query results are analyzed. At least one new predicate from at least one auxiliary data attribute is appended on the query.Type: ApplicationFiled: January 9, 2012Publication date: May 3, 2012Applicant: International Business Machines CorporationInventors: Yuan-Chi Chang, Matthew L. Hill
-
Patent number: 8140973Abstract: Aspects of the subject matter described herein relate to annotating and sharing content. In aspects, an annotation tool presents a user interface that allows a user to enter and view annotations associated with content such as a video. The annotation tool allows the user to associate each annotation with a particular time segment of the video such that when that time segment is played in a video player, its associated annotation is presented. The annotation tool also presents a user interface that allows the user to share the video as annotated with other users as desired. Other users receiving the annotated video may further annotate the video and share it with others.Type: GrantFiled: January 23, 2008Date of Patent: March 20, 2012Assignee: Microsoft CorporationInventors: Jeff D Sandquist, Grace G Francisco, David D Shadle, Sanjay Parthasarathy
-
Patent number: 8140522Abstract: A database query is partitioned into an initial partition including a plurality of parallel groups, and is executed, via an execution plan, based on the initial partition. A sampling subset of data is identified from the plurality of parallel groups. Substantially in parallel with the executing of the query, the execution plan is executed on the sampling subset of data as a sampling thread. The execution plan is modified based on feedback from the execution of the execution plan on the sampling subset of data.Type: GrantFiled: August 12, 2008Date of Patent: March 20, 2012Assignee: International Business Machines CorporationInventors: Hong Min, Yefim Shuf, Terence Patrick Purcell, You-Chin Fuh, Chunfeng Pei, Ou Jin
-
Patent number: 8135732Abstract: A suite of network-based services, such as the services corresponding to Microsoft® SharePoint™, are provided to users with high availability. To maintain the availability of the services, the configuration parameters of a first server are updated on an ongoing basis, and the updated configuration parameters are used to configure a second, backup server. In the event of switchover or failover, the backup server is prepared to provide the serving functionality of the first server.Type: GrantFiled: March 5, 2010Date of Patent: March 13, 2012Assignee: Computer Associates Think, Inc.Inventors: Hailin Peng, Zhenghua Xu, Xiaowei Yuan, Dongzhu Shi
-
Patent number: 8126905Abstract: A system, method, and computer-readable medium for optimizing the performance of outer joins in a parallel processing system are provided. Predicates involving only attributes of a left table of a left outer join are pushed down to the outer relation for left outer joins having join predicates involving left table attributes and/or predicates involving attributes of both the right and left table. In such an instance, the rows of the left table may be partitioned into two sub-relations according to the predicate involving only attributes of the left table. Rows of the left table are allocated to a first sub-relation if the rows satisfy the predicate involving only attributes of the left table and rows of the left table are allocated to a second sub-relation if the rows fail to satisfy the predicate involving only attributes of the left table. Accordingly, only rows of the first sub-relation are required to be left outer joined with the right table.Type: GrantFiled: September 23, 2008Date of Patent: February 28, 2012Assignee: Teradata US, Inc.Inventors: Yu Xu, Olli Pekka Kostamaa
-
Patent number: 8122046Abstract: Methods and apparatus are provided for rewriting queries during a database query processing operation to include auxiliary attributes not included in the original query, thus improving processing efficiency. For example, in one aspect of the invention, a technique for rewriting a query in a query processing operation includes the following steps. First, the query is processed in accordance with at least a portion of a data set, producing query results. Second, data attributes from the query results are analyzed. Finally, at least one new predicate from at least one auxiliary data attribute is appended on the query.Type: GrantFiled: September 10, 2007Date of Patent: February 21, 2012Assignee: International Business Machines CorporationInventors: Yuan-Chi Chang, Matthew L. Hill
-
Publication number: 20120036146Abstract: A database management system implemented in a cloud computing environment. Operational nodes are assigned as groups of controller-nodes, compute-nodes or storage-nodes. Queries specify one or more tables for an associated database operation, with each table being assigned to respective storage nodegroup(s). The number of nodes executing a given query may change, by (a) changing the compute-nodes associated with a connection, or (b) adding or removing nodes associated with a connection; and/or distributing data to a storage nodegroup based on a Distribution Method which may be either data dependent or data independent. A controller node further executes a Dynamic Query Planner (DQP) process that develops a query plan.Type: ApplicationFiled: October 4, 2011Publication date: February 9, 2012Applicant: ParElastic CorporationInventor: Mrithyunjaya Annapragada
-
Patent number: 8112438Abstract: A first transmitting unit transmits a processing command to a plurality of parallelized database servers. A second transmitting unit integrates data sets transmitted from the database servers in response to the processing command, and transmits an integrated data set to a client. An integrating unit integrates data sets buffered in a buffer unit. A determining unit determines a transmission start or a transmission suspend of the data sets based on a data size in the buffer unit. A third transmitting unit transmits a control command for the transmission start or the transmission suspend to the database servers based on a result of determination by the first determining unit.Type: GrantFiled: September 22, 2008Date of Patent: February 7, 2012Assignee: Kabushiki Kaisha ToshibaInventor: Masakazu Hattori
-
Patent number: 8095515Abstract: A method and system is provided for computing an approximation of the number of distinct results of a query over a relational data source. The approximation uses information about dependencies between fields of relations, in particular the number of distinct values of a field for each possible value of another field. This information can be obtained by analysis of the data stored in the relational data source, or may be specified as annotations to a database schema. An approximation of the number of results is and the dependencies between fields of each part of the query are computed. The approximation can be used to reorder parts of a query, by using the estimated size of parts to guide reordering. The approximation can further be used to determine which parts of a query are relevant to the evaluation of a subquery, which can be used to guide the magic sets transformation.Type: GrantFiled: March 18, 2009Date of Patent: January 10, 2012Assignee: Semmle LimitedInventors: Damien Sereni, Pavel Avgustinov, Oege de Moor
-
Patent number: 8090739Abstract: Methods, systems, and articles of manufacture for enhancing abstract queries by utilizing conditional modifiers with logical fields are provided. Conditional modifiers allow for the referencing of multiple physical fields via a single logical field. Further, conditional modifiers facilitate the ability to specify, on an instance by instance basis, which physical field or combination of physical fields a particular logical field should reference.Type: GrantFiled: October 14, 2004Date of Patent: January 3, 2012Assignee: International Business Machines CorporationInventors: Richard D. Dettinger, Daniel P. Kolz, Richard J. Stevens, Jeffrey W. Tenner
-
Patent number: 8078642Abstract: In one embodiment, a tree traversal sequentially processes every level of two or more binary trees until reaching a leaf node for each the binary trees. Processing each level of the binary trees comprises: determining whether each traversed node of the remaining binary trees at the level is a non-leaf node or a leaf node; for the traversed leaf nodes at the level, remove the binary trees to which the leaf nodes belong from the remaining binary trees; and iteratively evaluating the traversed non-leaf nodes at the level of every n remaining binary trees until the non-leaf nodes at the level of all of the remaining binary trees are evaluated, where n?2 and evaluating the non-leaf nodes of each n binary trees comprises concurrently evaluating the n non-leaf nodes of the n binary trees to determine to which one of the two child nodes of each of the n non-leaf nodes to traverse.Type: GrantFiled: July 24, 2009Date of Patent: December 13, 2011Assignee: Yahoo! Inc.Inventor: Tomi Poutanen
-
Patent number: 8060522Abstract: A tree-structured index to multidimensional data is created using naturally occurring patterns and clusters within the data which permit efficient search and retrieval strategies in a database of DNA profiles. A search engine utilizes hierarchical decomposition of the database by identifying clusters of similar DNA profiles and maps to parallel computer architecture, allowing scale up past previously feasible limits. Key benefits of the new method are logarithmic scale up and parallelization. These benefits are achieved by identification and utilization of naturally occurring patterns and clusters within stored data. The patterns and clusters enable the stored data to be partitioned into subsets of roughly equal size. The method can be applied recursively, resulting in a database tree that is balanced, meaning that all paths or branches through the tree have roughly the same length. The method achieves high performance by exploiting the natural structure of the data in a manner that maintains balanced trees.Type: GrantFiled: August 27, 2008Date of Patent: November 15, 2011Assignee: University of Tennessee Research FoundationInventors: John D. Birdwell, Tse-Wei Wang, Roger D. Horn, Puneet Yadav, David J. Icove
-
Patent number: 8051091Abstract: A first request to access a first set of items is received, wherein each item is associated with one or more properties. A second request to access a second set of items is also received. A determination is made as to whether items from the first set are in the second set of items, and the sets are divided into one or more subsets based on the determining. Each of the one or more subsets is assigned to a respective thread, and the respective thread of the subset that does not contain items in the second request is processed. This way, individual subsets (i.e. data partitions) can be processed by multiple threads in parallel without having to synchronize them.Type: GrantFiled: February 19, 2008Date of Patent: November 1, 2011Assignee: SAP AGInventors: Horst Werner, Christof Bornhoevd
-
Publication number: 20110264626Abstract: Methods for parallel query execution of a database operation on a database utilizing a graphics processing unit (GPU) are presented including: receiving query by a host, the query including database relations; starting a GPU kernel, where the GPU kernels include a GPU memory; hash partitioning the database relations by the GPU kernel; loading the partitioned database relations into the GPU memory; loading keyed partitions corresponding the hash partitioned database relations into the GPU memory; building a hash table for a smaller of the hash partitioned database relations; and executing the query. In some embodiments, methods further include returning a result of the query. In some embodiments, methods further include when the query is a long query including a number of operators, parsing the long query into a number of sub-queries; for each of the sub-queries, starting one of the GPU kernels such that the sub-queries are processed in parallel.Type: ApplicationFiled: April 22, 2010Publication date: October 27, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Akshay Gautam, Ritesh K. Gupta
-
Patent number: 8041707Abstract: A database management system has a query interface for receiving a query and a query executor for executing the received query. The query executor dynamically generates a task, and executes a plurality of tasks in parallel. In execution of each task, each time data is required to be read from a database, the query executor generates a task for acquiring the data, and in execution of the generated task, issues a data read request for reading the data from the database, to thereby shorten a time taken to execute each task.Type: GrantFiled: October 4, 2010Date of Patent: October 18, 2011Inventors: Masaru Kitsuregawa, Kazuo Goda
-
Patent number: 8037085Abstract: A method for performing verification includes selecting a first set containing a seed register and adding to a second set a result of a subtraction of a fanout of the first set from a fanin of the first set. A third set is rendered equal to a result of a subtraction of a fanin of the second set from a fanout of the second set, and whether a combination of the first set and the third set is equivalent to the first set is determined. In response to determining that the combination of the first set and the second set is not equivalent to the first set, a min-cut of the first set and the second set containing a minimal set of predicates between a first component and the logic to which the component fans out, wherein the logic is bordered by the second set is returned.Type: GrantFiled: May 30, 2008Date of Patent: October 11, 2011Assignee: International Business Machines CorporationInventors: Jason R. Baumgartner, Hari Mony, Viresh Paruthi, Fadi Z. Zaraket
-
Patent number: 8010550Abstract: Various technologies and techniques are disclosed for transforming a sequential loop into a parallel loop for use with a transactional memory system. A transactional memory system is provided. A first section of code containing an original sequential loop is transformed into a second section of code containing a parallel loop that uses transactions to preserve an original input to output mapping. For example, the original sequential loop can be transformed into a parallel loop by taking each iteration of the original sequential loop and generating a separate transaction that follows a pre-determined commit order process. At least some of the separate transactions are executed in different threads. When an unhandled exception is detected that occurs in a particular transaction while the parallel loop is executing, state modifications made by the particular transaction and predecessor transactions are committed, and state modifications made by successor transactions are discarded.Type: GrantFiled: June 4, 2007Date of Patent: August 30, 2011Assignee: Microsoft CorporationInventors: John Joseph Duffy, Jan Gray, Yosseff Levanoni
-
Patent number: 8010551Abstract: A computer server system may include a plurality of database modules for storing user data for a plurality of users, and at least one processing module comprising a plurality of processing threads for processing jobs for users based upon respective user data. The computer server system may further include a database pool module connected between the plurality of database modules and the at least one processing module. The database pool module may be for selectively connecting the processing threads to corresponding database modules including respective user data for jobs to be processed, and determining when a database module becomes unresponsive and terminating processing thread connections to the unresponsive database module based thereon. The database pool module may also be for determining when the unresponsive database module becomes responsive and restoring processing thread connectivity thereto based thereon.Type: GrantFiled: May 3, 2010Date of Patent: August 30, 2011Assignee: Research in Motion LimitedInventors: Nathan Provo, Harshad N. Kamat
-
Patent number: 8005770Abstract: A method for generating a Bayesian network in a parallel manner is based on an initial model having a plurality of nodes. Each node corresponds to a variable of a data set and has a local distribution associated therewith. The method includes assigning a plurality of subsets of the nodes to a respective plurality of constructors. The plurality of constructors is operated in a parallel manner to identify edges to add between nodes in the initial model. The identified edges are added to the initial model to generate the Bayesian network. The edges indicate dependency between nodes connected by the edges.Type: GrantFiled: June 9, 2008Date of Patent: August 23, 2011Assignee: Microsoft CorporationInventors: Chi Cao Minh, Max Chickering, John Feo, Jaime Hwacinski, Anitha Panapakkam, Khaled Sedky
-
Patent number: 7984061Abstract: Website search results obtained from searching multiple electronic information stores may be displayed transparently without distinguishing the electronic information store. The search may be performed by a web host and may include receiving at least one search term that then is compared with first electronic information within a first electronic information store to determine whether matches exist, where the first electronic information includes content provided by an internal source. The search term also is compared with second electronic information within a second electronic information store to determine whether matches exist, where the second electronic information includes content provided by an external source. Results are displayed based on matches that are determined to exist with the first electronic information and the second electronic information. The results are combined in a single list of results.Type: GrantFiled: April 14, 2008Date of Patent: July 19, 2011Assignee: AOL Inc.Inventors: Surendra Goel, David E. Kellum, Thomas E. Donaldson
-
Patent number: 7974965Abstract: A method of processing a plurality of instances in a federated deployment of SOA applications can include the steps of receiving a transaction request to retrieve data, the request specifying retrieving the data stored according to range of indices of the federated deployment, processing each of the instances in a predetermined order to retrieve the data; and calculating a total number of records in the federated deployment.Type: GrantFiled: December 17, 2007Date of Patent: July 5, 2011Assignee: International Business Machines CorporationInventors: Olena Woolf, Joseph Kin Wing Tsang, Zahid Naeem
-
Patent number: 7970782Abstract: Systems and methods are provided for filtering data in a database using an execution plan. The execution plan has a first processing pass against the database that calculates a filter set using a filter criteria, and a second processing pass against the filter set that calculates a report result.Type: GrantFiled: April 30, 2002Date of Patent: June 28, 2011Assignee: Microstrategy IncorporatedInventors: Jeffrey A. Bedell, William Hurwood, Benjamin Z. Li, Fabrice Martin, Sadanand Sahasrabudhe, Jun Yuan
-
Publication number: 20110153634Abstract: A capability is provided for supporting a service location capability in a peer-to-peer network (P2P), such as a Chord network or other P2P network. In one embodiment, a method for locating a service within a P2P network is provided. The P2P network includes a plurality of nodes, including a target node which performs the method for locating the service within the P2P network. The target node includes a search table including a plurality of entries identifying a respective plurality of nodes of the P2P network. The method includes detecting a request to search for the service within the P2P network and initiating, toward at least one of the nodes of the search table, a service search request. The service search request is a request to identify at least one node of the P2P network that supports the service. The service search request includes information indicative of the service and a search range for use by the node receiving the service search request.Type: ApplicationFiled: December 17, 2009Publication date: June 23, 2011Inventors: Thomas P. Chu, Ramesh Nagarajan
-
Patent number: 7966340Abstract: A system and method of massively parallel data processing are disclosed. In an embodiment, a method includes generating an interpretation of a customizable database request which includes an extensible computer process and providing an input guidance to available processors of an available computing environment. The method further includes automatically distributing an execution of the interpretation across the available computing environment operating concurrently and in parallel, wherein a component of the execution may be limited to at least a part of an input data. The method also includes automatically assembling a response using a distributed output of the execution.Type: GrantFiled: September 8, 2010Date of Patent: June 21, 2011Assignee: Aster Data Systems, Inc.Inventors: Eric Friedman, Peter Pawlowski
-
Patent number: 7953714Abstract: In one implementation, a method for sustaining database processing parallelism of one or more parallelized processes to build one or more index pages using pseudo record identifiers (PRIDs) is disclosed. The method comprises generating one or more PRIDs for one or more respective internal record formats (IRFs), inserting said generated PRIDs into a respective index key, generating a relational index of the PRID and a predetermined record identifier (RID) respectively determined in relation to said IRF, and building one or more index pages in relation to the relational index by comparing said RID and said PRID for their respective IRF in said relational index, and determining which one of said RID or said PRID to insert into said index page.Type: GrantFiled: August 31, 2007Date of Patent: May 31, 2011Assignee: International Business Machines CorporationInventors: Lee Chu, Michael T. Ho, Leo T. M. Lau, David Tremaine
-
Publication number: 20110087684Abstract: Disclosed herein is parallel processing of a query, which uses inter-query parallelism in posting list intersections. A plurality of tasks, e.g., posting list intersection tasks, are identified for processing in parallel by a plurality of processing units, e.g., a plurality of processing cores of a multi-core system.Type: ApplicationFiled: October 12, 2009Publication date: April 14, 2011Inventors: Flavio Junqueira, Berkant Barla Cambazoglu, Vassilis Plachouras, Shirish Tatikonda
-
Publication number: 20110072032Abstract: A method for data transfer in a data processing system, and corresponding system and machine-readable medium. One method includes receiving by the data processing system a request for a data structure from a calling process, and splitting the data structure into a plurality of substructures by the data processing system. That method includes transferring the plurality of substructures to the calling process by the data processing system, wherein at least two of the substructures are transferred in parallel, and maintaining a transfer state for each substructure in the data processing system.Type: ApplicationFiled: September 21, 2009Publication date: March 24, 2011Applicant: Siemens Product Lifecycle Management Software Inc.Inventors: John Staehle Whelan, Mark Ludwig
-
Publication number: 20110047172Abstract: One embodiment is a method that uses MapReduce and Relation Valued Functions (RVFs) with parallel processing to search a database and obtain search results.Type: ApplicationFiled: August 20, 2009Publication date: February 24, 2011Inventors: Qiming Chen, Bin Zhang, Ren WU, Andy Therber, Meichun Hsu, Hans Zeller, David Birdsall