摘要:
A computerized method useful for node cluster formation and management in a distributed database system includes the step of providing a set of database nodes in a database cluster. Each node of the set of database nodes comprises a cluster management module, a heartbeat module, and a globally unique node identifier. The cluster management module manages cluster membership by maintaining a succession list. The succession list comprises a list of all current members in the database cluster. The heartbeat module communicates a pulse message to every other node in the set of database nodes. The method includes the step of maintaining, with each heartbeat module of each database node, an adjacency list.
摘要:
A computer-implemented method of a distributed database system includes generating a database index. The method includes mapping a first specified number of bits of the database index to a database key. The method includes mapping a second specified number of bits to a data object associated with the database key. The method includes storing the first specified number of bits of the database key in a dram memory. The method includes storing second specified number of bits with the data object in a solid-state device (SSD) storage.
摘要:
Embodiments of the invention are directed to determining a universal device identifier (UDID) for a client device, based on multiple service-dependent identifiers (SDIDs) used by client applications, websites, or other services to identify the client device. SDID types are prioritized with pre-assigned weights. A received SDID causes a single database read to access all other SDIDs, and any existing UDID(s) associated with the client device. A final UDID is created or selected based on the SDID weights. The database is updated in a sequence that enables self recovery of a prior UDID in case of database error during update. First, any non-selected UDID records are updated with the final UDID. Next, lower weighted SDID records are updated. The final UDID record is updated. The highest weighted SDID record is updated last, to preserve the prior UDID as long as possible in case of update error, which aborts the remaining update.
摘要:
Embodiments of the invention are directed to determining a universal device identifier (UDID) for a client device, based on multiple service-dependent identifiers (SDIDs) used by client applications, websites, or other services to identify the client device, SDID types are prioritized with pre-assigned weights. A received SDID causes a single database read to access all other SDIDs, and any existing UDID(s) associated with the client device. A final UDID is created or selected based on the SDID weights. The database is updated in a sequence that enables self recovery of a prior UDID in case of database error during update. First, any non-selected UDID records are updated with the final UDID. Next, lower weighted SDID records are updated. The final UDID record is updated. The highest weighted SDID record is updated last, to preserve the prior UDID as long as possible in case of update error, which aborts the remaining update.
摘要:
A method and apparatus are provided for removing an attachment from content and/or metadata before routing a command including the attachment through a command memory of a content router and for reattaching the attachment to an associated command after receiving the command from the command memory.
摘要:
An object-relational database gateway for use in a computing environment having a relational database management system (RDBMS) is disclosed. Object-oriented objects in the computing environment conform to a class inheritance hierarchy defined by an object-oriented schema. The gateway includes a query generator to generate from an object-oriented query a set of relational queries. The object-oriented query identifies one or more target objects of a target class which are desired to be constructed. The set of relational queries, when processed, enable the RDBMS to retrieve tuples required to initialize base attributes of the target objects that are defined by the target class and by any super-classes and sub-classes of the target class. The gateway also includes a tuple-to-object translator to translate the tuples to object-oriented objects consistent with the class inheritance hierarchy.
摘要:
In one exemplary embodiment, a method includes allocating an arena block of a shared memory of a database node server. The arena block is divided into one or more slots. The one or more slots include a discreet and constant area of memory within the arena block. Each slot is assigned a constant-memory address relative to an arena-block's shared memory address. The index is implemented as a red-black tree data structure. Each red-black tree node is mapped to a slot. Each red-black-tree node is provided a pointer to one or more neighbor nodes. The index stored in shared memory can be used during a ‘warm’ rebooting process.
摘要:
In one exemplary embodiment, a method of a distributed database system includes the step receiving a query in a query language from a client with a distributed database system. An index that matches the query is located. The index is pre-generated from a database table in the distributed database system. A map function of a MapReduce programming model is implemented using the index. A reduce function of the MapReduce programming model is implemented using the output of the map function. Optionally, a finalize function can be implemented using the output of the reduce function. The distributed database system can be a scalable NoSQL database. The reduce function can be optional when the value of the output of the map function is guaranteed to be unique.
摘要:
In one exemplary embodiment, a method of a distributed database system includes the step receiving a query in a query language from a client with a distributed database system. An index that matches the query is located. The index is pre-generated from a database table in the distributed database system. A map function of a MapReduce programming model is implemented using the index. A reduce function of the MapReduce programming model is implemented using the output of the map function. Optionally, a finalize function can be implemented using the output of the reduce function. The distributed database system can be a scalable NoSQL database. The reduce function can be optional when the value of the output of the map function is guaranteed to be unique.
摘要:
In one exemplary embodiment, a method includes allocating an arena block of a shared memory of a database node server. The arena block is divided into one or more slots. The one or more slots include a discreet and constant area of memory within the arena block. Each slot is assigned a constant-memory address relative to an arena-block's shared memory address. The index is implemented as a red-black tree data structure. Each red-black tree node is mapped to a slot. Each red-black-tree node is provided a pointer to one or more neighbor nodes. The index stored in shared memory can be used during a ‘warm’ rebooting process.