Patents Assigned to Calpont Corporation
  • Publication number: 20060095900
    Abstract: A semantic processor for a hardware database management system is described that is operable to take statements in a standardized language and parse those statements. The semantic processor includes a tokenizer for separating the statement into its individual elements and identifying keywords and operators. A precedence engine then orders the elements of the statement into the proper execution order and a function compiler creates an execution tree and determines which element are free of dependencies and can be executed.
    Type: Application
    Filed: August 26, 2004
    Publication date: May 4, 2006
    Applicant: Calpont Corporation
    Inventors: Frederick Petersen, Zhixuan Zhu
  • Publication number: 20060047733
    Abstract: A method is described for converting standard integer and floating point formatted numbers to an improved integer and floating point numbers which are binary orderable. Standard integers are represented in two's complement format, to make standard integers binary orderable, the sign bit is flipped. To make floating point numbers binary orderable the implicit leading bit of the mantissa needs to be made explicit. Next the mantissa is converted to two's complement format, and the sign bit is flipped. Finally, for negative numbers the exponent is inverted, or XORed with all 1s.
    Type: Application
    Filed: August 26, 2004
    Publication date: March 2, 2006
    Applicant: Calpont Corporation
    Inventors: Mark Hervin, Michael Early
  • Publication number: 20050234882
    Abstract: A data structure for a hardware database system is described. The data structure is made up of multiple sub-trees interconnected to form a graph structure. Each sub-tree begins at a memory location, or root address. Next the sub-tree includes profile information relevant to the sub-tree, such profile information can include, but is not limited to, information on the type of data being stored, the number of entries in the sub-tree, privilege information for accessing the sub-tree, etc. After the profile information the sub-trees contain search strings, or differential bits that lead to each of the entries in the sub-tree. Each search string ends in a result string. The result string can be actual data, can be a pointer to another sub-tree, can be a function call, or can be any other useful data or entry.
    Type: Application
    Filed: April 20, 2004
    Publication date: October 20, 2005
    Applicant: Calpont Corporation
    Inventors: Victor Bennett, Frederick Petersen
  • Publication number: 20050216517
    Abstract: A graph processor for a hardware database is described which is operable to manipulate, such as reading, writing, or altering, information in a database, or other collection of information. The graph processor includes a read engine and a write engine, the read engine operable to compare the search object against the information in the database and return results based on the comparison. The write engine is operable to write new information into the database by first locating the first differential bit between the information to be written and the existing contents of the database. Once the differential bit has been located the write engine creates a new branch and inserts the data into the database.
    Type: Application
    Filed: March 24, 2004
    Publication date: September 29, 2005
    Applicant: Calpont Corporation
    Inventors: Victor Bennett, Frederick Petersen
  • Publication number: 20050138006
    Abstract: A method for implementing a hardware database management system in hardware is described. A parser takes standardized database statements and converts those statements into a set of executable instructions and associated data objects. The executable instructions and data objects are then sent to the execution tree engine where an execution tree is created, the execution tree forming the order of execution for the executable instructions. The graph engine receives those executable instructions from the execution tree engine that require access to the database in memory and manipulates the information in the database as required by the executable instructions for implementing the standardized database statement.
    Type: Application
    Filed: December 19, 2003
    Publication date: June 23, 2005
    Applicant: Calpont Corporation
    Inventors: Victor Bennett, Gregory Geiger, Gerald Platz, Sean Bennett, Aya Bennett, Michael Early, Randall Simpson, Frederick Petersen, Kenneth Mahrt, Zhixuan Zhu
  • Publication number: 20050086245
    Abstract: An architecture for a hardware database management system is described. A data flow engine is connected to memory storing the information making up a database or databases. The data flow engine is formed by a parser, an execution tree engine and a graph engine. The parser takes standardized database statements and converts those statements into a set of executable instructions and associated data objects. The executable instructions and data objects are then sent to the execution tree engine where an execution tree is created, the execution tree forming the order of execution for the executable instructions. The graph engine receives those executable instructions from the execution tree engine that require access to the database in memory and manipulates the information in the database as required by the executable instructions for implementing the standardized database statement.
    Type: Application
    Filed: October 15, 2003
    Publication date: April 21, 2005
    Applicant: Calpont Corporation
    Inventors: Victor Bennett, Frederick Petersen, Gerald Platz
  • Publication number: 20040158572
    Abstract: A database and database management system are implemented entirely in hardware. The information forming the database is stored in random access memory which is connected to a data flow engine. The data flow engine is able to process statements in standard database protocols such as SQL and XML, and to manipulate (read, write and alter) the database in accordance with the statements. The data flow engine is connected to a microprocessor that receives the statements from the database user or database application server and sends them to the data flow engine for processing. The results from the data flow engine are returned to the microprocessor and the microprocessor then returns the results to the user or application server.
    Type: Application
    Filed: November 13, 2003
    Publication date: August 12, 2004
    Applicant: Calpont Corporation
    Inventors: Victor A. Bennett, Gregory E. Geiger, Gerald R. Platz, Sean M. Bennett, Aya N. Bennett, Michael B. Early, Randall A. Simpson, Frederick R. Petersen, Kenneth Lee Mahrt, Zhixuan Zhu