Abstract: A system and method for unclogging a drain involving at least one internal member and at least one external member. At least one member is ferromagnetic, and at least one member is a magnet. External members may have handles. Internal members are disposed inside a pipe and external members are disposed outside a pipe. When an external member is moved, the magnetic force between the internal and external members causes the internal member to move. Internal members can be disposed such that they cause a clog to move further into the drain system. Internal members can also be disposed such that they are below the clog when it forms, allowing the internal members to move the clog out of the pipe system, into the sink, toilet, or other basin. Safety members can be disposed below the internal members to prevent loss of internal members into pipe system.

Abstract: A system and method for unclogging a drain involving at least one internal member and at least one external member. At least one member is ferromagnetic, and at least one member is a magnet. External members may have handles. Internal members are disposed inside a pipe and external members are disposed outside a pipe. When an external member is moved, the magnetic force between the internal and external members causes the internal member to move. Internal members can be disposed such that they cause a clog to move further into the drain system. Internal members can also be disposed such that they are below the clog when it forms, allowing the internal members to move the clog out of the pipe system, into the sink, toilet, or other basin. Safety members can be disposed below the internal members to prevent loss of internal members into pipe system.

Abstract: A distributed database system providing data and space management methodology. In one embodiment a system for allocating resources amongst a plurality of database servers sharing resources comprises: an input module for receiving user input for allocating resources shared amongst a plurality of database servers and establishing thresholds for utilization of resources at each database server; a monitoring module at each database server for monitoring local resource utilization at each database server and sending a request for balancing resources to a second database server when local resource utilization reaches an established threshold at a first database server; and a load balancing module for receiving the request for balancing resources and determining whether to adjust resources allocated to the first database server and the second database server in response to the request.

Abstract: Disclosed is a trade evaluator for evaluating trades based on statistics of players to be traded, statistics of other players on each fantasy team, and settings of a fantasy league. A computer receives a request to analyze a trade of one or more players for one or more other players. The computer determines league settings and player statistics. For each player on the teams, the computer determines a position in a roster. The computer determines a highest value player for each position. If there is only one slot that can hold the highest ranked player still available to place, the computer fills the slot with that player. If there are multiple slots left, and each of those slots can also hold other player positions, the computer places the player in a slot with a lowest opportunity cost. The computer determines a point total for the teams with and without execution of the trade.

Abstract: Disclosed is a trade evaluator for evaluating trades based on statistics of players to be traded, statistics of other players on each fantasy team, and settings of a fantasy league. A computer receives a request to analyze a trade of one or more players for one or more other players. The computer determines league settings and player statistics. For each player on the teams, the computer determines a position in a roster. The computer determines a highest value player for each position. If there is only one slot that can hold the highest ranked player still available to place, the computer fills the slot with that player. If there are multiple slots left, and each of those slots can also hold other player positions, the computer places the player in a slot with a lowest opportunity cost. The computer determines a point total for the teams with and without execution of the trade.

Abstract: Disclosed is a trade evaluator for evaluating trades based on statistics of players to be traded, statistics of other players on each fantasy team, and settings of a fantasy league. A computer receives a request to analyze a trade of one or more players for one or more other players. The computer determines league settings and player statistics. For each player on the teams, the computer determines a position in a roster. The computer determines a highest value player for each position. If there is only one slot that can hold the highest ranked player still available to place, the computer fills the slot with that player. If there are multiple slots left, and each of those slots can also hold other player positions, the computer places the player in a slot with a lowest opportunity cost. The computer determines a point total for the teams with and without execution of the trade.

Abstract: Disclosed is a trade evaluator for evaluating trades based on statistics of players to be traded, statistics of other players on each fantasy team, and settings of a fantasy league. A computer receives a request to analyze a trade of one or more players for one or more other players. The computer determines league settings and player statistics. For each player on the teams, the computer determines a position in a roster. The computer determines a highest value player for each position. If there is only one slot that can hold the highest ranked player still available to place, the computer fills the slot with that player. If there are multiple slots left, and each of those slots can also hold other player positions, the computer places the player in a slot with a lowest opportunity cost. The computer determines a point total for the teams with and without execution of the trade.

Abstract: A distributed database system providing data and space management methodology. In a distributed database system having an allocation page for tracking allocation and deallocation of data pages including a deallocation bit for tracking data page deallocation, a method for determining when to clear the deallocation bit during recovery comprises: during runtime operation, generating log records recording allocation and deallocation of data pages, setting the deallocation bit during deallocation of a data page by a transaction, and clearing the deallocation bit after the transaction has committed; during recovery following a failure, identifying a particular log record corresponding to the deallocation bit set during deallocation of a given data page; determining whether the deallocation of the given data page recorded in the particular log record committed prior to the failure; and if the deallocation of the given data page committed prior to the failure, clearing the deallocation bit.

Abstract: A distributed database system providing data and space management methodology. In a distributed system consisting a plurality of servers sharing access to data pages, a method for setting a timestamp indicating when modifications to data pages are made in a non-regressing fashion includes steps of: maintaining a local sequence at each server and an allocation page timestamp on an allocation page; upon allocation of a data page, applying a timestamp to the data page which is greater than the allocation page timestamp; upon modification of a given data page at a particular server, setting the timestamp on the given data page to the greater of the local sequence at the particular server and an existing timestamp already on the given data page; and when data pages are deallocated, adjusting the allocation page timestamp to a value greater than the timestamp value on any deallocated data page.

Abstract: A distributed database system providing data and space management methodology. In one embodiment, for example, a method for transferring a data structure in cache at a first database server to a second database server in a distributed database system comprises steps of: determining a first database server having a data structure in cache in response to a request for the data structure from a second database server, the request including a request for a lock on the data structure; providing the request for the data structure to the first database server; in response, sending the data structure from the first database server to the second database server; and receiving and using the data structure at the second database server without waiting for the lock request to be explicitly granted.

Abstract: A distributed database system providing data and space management methodology. In a distributed database system having an allocation page for tracking allocation and deallocation of data pages including a deallocation bit for tracking data page deallocation, a method for determining when to clear the deallocation bit during recovery comprises: during runtime operation, generating log records recording allocation and deallocation of data pages, setting the deallocation bit during deallocation of a data page by a transaction, and clearing the deallocation bit after the transaction has committed; during recovery following a failure, identifying a particular log record corresponding to the deallocation bit set during deallocation of a given data page; determining whether the deallocation of the given data page recorded in the particular log record committed prior to the failure; and if the deallocation of the given data page committed prior to the failure, clearing the deallocation bit.

Abstract: A distributed database system providing data and space management methodology. In a distributed system comprising a plurality of servers sharing access to data pages, a method for setting a timestamp indicating when modifications to data pages are made in a non-regressing fashion comprises steps of: maintaining a local sequence at each server and an allocation page timestamp on an allocation page; upon allocation of a data page, applying a timestamp to the data page which is greater than the allocation page timestamp; upon modification of a given data page at a particular server, setting the timestamp on the given data page to the greater of the local sequence at the particular server and an existing timestamp already on the given data page; and when data pages are deallocated, adjusting the allocation page timestamp to a value greater than the timestamp value on any deallocated data page.

Abstract: A distributed database system providing data and space management methodology is described. In one embodiment, for example, a method is described for detection of deadlocks in a distributed database system comprising a plurality of servers sharing access to data, the method comprises steps of: in response to a task at a first server waiting to obtain a lock regulating access to data, sending a search request including lock information to a second server holding the lock; at the second server, examining dependencies of the task holding the lock based on the lock information received with the search request and local lock information; if the task holding the lock is waiting to obtain a lock held by an additional server, forwarding the search request and local lock information to the additional server; repeating the examining and forwarding steps until all dependencies are examined; and responding to the search request indicating whether a deadlock was detected and providing lock information found.

Abstract: A distributed database system providing data and space management methodology. In one embodiment a system for allocating resources amongst a plurality of database servers sharing resources comprises: an input module for receiving user input for allocating resources shared amongst a plurality of database servers and establishing thresholds for utilization of resources at each database server; a monitoring module at each database server for monitoring local resource utilization at each database server and sending a request for balancing resources to a second database server when local resource utilization reaches an established threshold at a first database server; and a load balancing module for receiving the request for balancing resources and determining whether to adjust resources allocated to the first database server and the second database server in response to the request.

Abstract: A distributed database system providing data and space management methodology is described. In one embodiment, for example, a method is described for detection of deadlocks in a distributed database system comprising a plurality of servers sharing access to data, the method comprises steps of: in response to a task at a first server waiting to obtain a lock regulating access to data, sending a search request including lock information to a second server holding the lock; at the second server, examining dependencies of the task holding the lock based on the lock information received with the search request and local lock information; if the task holding the lock is waiting to obtain a lock held by an additional server, forwarding the search request and local lock information to the additional server; repeating the examining and forwarding steps until all dependencies are examined; and responding to the search request indicating whether a deadlock was detected and providing lock information found.