Abstract: In an embodiment, a constraint is created for a database table. The constraint specifies a condition for a first column in the database table and an action. The action specifies whether data that violates the condition is allowed to be stored in the first column. A value and a specification of a second column in the database table are received from a data source. If the second column is identical to the first column, the value violates the condition, and the action specifies that data that violates the condition is allowed to be stored, the value is stored in a row in the database, the row is marked as hidden, and an identification of the constraint that was violated is stored in the row. A query does not return the row that is marked as hidden.

Abstract: In an embodiment, a request is received that includes a specification of a static location and a dynamic location. A static image is created that includes a map that represents an area centered around the static location. A dynamic image is created asynchronously from the creation of the static image. An amalgamated image is generated that includes the static image and the dynamic image, which is over a portion of the static image. In this way, spatial data may be drawn in a manner that increases performance.

Abstract: A method, apparatus, system, and signal-bearing medium that in an embodiment find all those breakpoints that meet a selection criteria and add the breakpoints to a breakpoint group. In various embodiments, the selection criteria may be a condition criteria, a hierarchy criteria, or a skipping criteria. In this way, the programmer is freed from needing to individually add breakpoints to the group and all the breakpoints in the group may be enabled, disabled, or removed as a group.

Abstract: A method, storage medium, and electronic device that in an embodiment register a plurality of information suppliers and a plurality of areas of interest associated with the plurality of respective information suppliers. One of the plurality of areas of interest associated with one of the plurality of information suppliers is found that matches a field of interest requested by a client. A plurality of records is requested from the one of the plurality of information suppliers. A model norm is created based on a data dictionary, wherein a format of the data dictionary is standardized by an agreement among the plurality of information suppliers. A subset of a plurality of characteristics is selected from the plurality of records based on the model norm. A report is prepared with the subset.

Abstract: A method, apparatus, system, and signal-bearing medium that, in an embodiment, select a command to send to memory. In an embodiment, the oldest command in a write queue that does not collide with a conflict queue is sent to memory and added to the conflict queue if some or all of the following are true: all of the commands in the read queue collide with the conflict queue, any read command incoming from the processor does not collide with the write queue, the number of commands in the write queue is greater than a first threshold, and all commands in the conflict queue have been present for less than a second threshold. In an embodiment, a command does not collide with a queue if the command does not access the same cache line in memory as the commands in the queue. In this way, in an embodiment, write commands are sent to the memory at a time that reduces the impact on the performance of read commands.

Abstract: A storage medium and computer that determine a tree representing links embedded in documents, create a depth indicator having a size proportional to the size of the tree, and display the depth indicator with a root link in a root document. The tree is determined by repeatedly probing the links to retrieve the documents. In various embodiments, the size of the tree may be the number of levels in the tree or the number of links in the tree. The depth indicator may include representations of the links and represents a possible future context of the root document. In various embodiments, a graphical representation of the tree may be displayed, hover help that includes the tree size may be displayed, and an indication of a condition reported by a document may be displayed. In various embodiments, the condition may include a message, updated content, new content, or an error.

Abstract: A method, apparatus, system, and signal-bearing medium that, in an embodiment, determine whether an amount of usage of a resource, which is used under a temporary usage plan, exceeds a threshold. If that determination is true, a quantity of the resource is calculated and that quantity is converted from the temporary usage plan to a permanent usage plan, without further charge to the customer. In another embodiment, a different resource may be converted to the permanent usage plan than the resource that was temporarily used. In various embodiments, the calculation of the quantity is made based on an attribute of the computer that uses the resource or based on an activation code received from the provider of the resource. In various embodiments, the amount of the usage is either a time amount of use or a monetary amount charged for the resource under the temporary usage plan.

Abstract: In an embodiment, a link to a current page is received from a user. In response to receiving the link, a descendant page of the current page is selected that meets a policy associated with the domain of the current page. The current page and the descendant page are retrieved and displayed. The current page and the descendant page are simultaneously viewable. The current page and the descendant page are in the same domain. In various embodiments, the descendant page is specified by a server, by the user, or is on a most-frequently traversed path in the domain. In various embodiments, the descendant page is a terminal page on the most-frequently traversed path or is at a level on the path that is specified by the policy.

Abstract: A computer system and storage medium that, in an embodiment, prohibit breakpoints from being set within a protected range. In an embodiment, a protected range may be an atomic operation synchronization code range, either based on instructions generated by a compiler or based on source statements that are compiler directives. When a command, such as an add breakpoint command is received, the address of the breakpoint is compared to the protected range, and if the address is within the protected range, the breakpoint is not set. In another embodiment, if the address is within the protected range, the breakpoint is set before the start or after the end of the protected range. In this way, the problems of endless loops may be obviated.

Abstract: An apparatus, system, and storage medium that in an embodiment receive a key parameter from a container-managed persistent bean, determine that the container-managed persistent bean is associated with a non-relational data store, creating a web service input message with the key parameter, and invoke a web service function with the web service input message to interface with a non-relational data store. The determination that the container-managed persistent bean is associated with a non-relational data store may be based on deployment description extension settings specified by a bean assembler. In this way, a container-managed persistent bean may be used to access a non-relational data store.

Abstract: A method of generating debug data in a simulation environment includes generating a listing of one or more signals that relate to a failure signal; monitoring simulation data of the one or more signals for transitions between a defined state and an undefined state; and generating a waveform of data based on the transitions between the defined state and the undefined state.

Abstract: An apparatus, system, and storage medium that, in an embodiment, receive a constraint command that specifies a parent table, a primary key in the parent table, a child table, and a foreign key in the child table, and enforce that all values for the primary key in the parent table are present in the foreign key in the child table. In an embodiment, the enforcing may include receiving an insert command that specifies a target key, a target value for the target key, and a target table; determining whether the target table matches the parent table and whether, within a transaction that includes the insert command, the child table includes at least one row with a foreign key value that equals the target value of the primary key; inserting the target value in the target table if the determining is true; and returning an error otherwise.

Abstract: In a first aspect, a first method of improving security of a network system is provided. The first method includes the steps of (1) providing a plurality of devices coupled via a network, wherein one or more of the devices are adapted to execute at least one client and one or more of the devices are adapted to execute at least one server in a client-server relationship; and (2) employing software, functionality of which is based on client-specific criteria or operational condition criteria of the system, to reduce a number of times a user of a client of the system must provide first authentication data to access data from one or more servers of the system. Numerous other aspects are provided.

Abstract: In an embodiment, a selection of an original transaction is received. In response to the selection of the original transaction, a call stack of the application that sends the original transaction during a learn mode of the application is saved. A specification of a new transaction and a location of the new transaction with respect to the original transaction in an transaction stream is received. During a production mode of the application, the original transaction is received from the application. A determination is made that the call stack of the application during the production mode matches the saved call stack of the application during the learn mode. In response to the determination, the new transaction is inserted at the location into a transaction stream that is sent to a database.

Abstract: A method, apparatus, system, and signal-bearing medium that in an embodiment verify that if a selected first link in a first page points to a reciprocal site, then a reciprocal link in a reciprocal page points back to the first page. The verification is performed by finding the reciprocal page and searching it for the reciprocal link. If the reciprocal link does not exist, then in various embodiments, the first link is removed or is removed after a time period has elapsed or a number of times has been exceeded, or a user is warned of the lack of the reciprocal link. In this way, reciprocal links are tracked to verify that the first page is receiving the agreed-upon links.

Abstract: In an embodiment, frames are received in an arrival order. Each of the frames has a target client and a sequence number that represents a relative position of the frame in the arrival order. A transmission order is determined based on bit reversals of the sequence numbers. Then frames are then sent to the respective target client in the transmission order. A frame is sent to the target client from its slot during a respective time period that is associated with the slot. If the slot is empty, no data is sent during the respective time period. In this way, the transmission of frames is spread over the available time.

Abstract: A method, apparatus, system, and signal-bearing medium that, in an embodiment, log trace data in response to an exception if the exception meets a filter criteria and create quality data from the trace data if a class in a call stack associated with the exception is owned by a user defined in a user table. In an embodiment, the quality data includes an identification of the user, a count of a number of times the exception was encountered by the user, and an identification of the exception. In various embodiments, the filter criteria may be an exception type, classes that initiate the exception, or packages that contain the classes that initiate the exception.

Abstract: A method, apparatus, system, and non-transitory computer-readable storage medium that in an embodiment dynamically allocate client requests to target servers based on prepare messages sent by the target servers. The addresses of target servers are added to a queue in response to the prepare messages from the target servers. A network interface is then prepared to receive an incoming call request from a client. After the call request arrives from a client, one of the addresses is selected from the queue. The call request is then sent through a tunnel to the target server associated with the selected address.

Abstract: In an embodiment, data is partitioned into partitions, which are divided into levels. The levels are ordered by creation times of the levels. A request is received at a current partition, which includes a key that identifies a field in a record and a value for the key. A determination is made whether the value exists in the field in the current partition. If the determination is false, a message is sent from the current partition to a next-older partition, and the message instructs the next-older partition to move the record with the value from the next-older partition to the current partition. If the determination is true, the record with the value in the field is moved from the current partition to a next-newer partition if the next-newer partition sent the request, and the record is deleted from the current partition.

Abstract: In an embodiment, a sentence is created that describes a walk of a graph. The graph includes a set of nodes and a set of edges that are incident to the nodes. The sentence includes label words that describe the nodes and relationship words that describe the edges. The walk is an alternating sequence of a subset of the nodes and of the edges. Each of the edges in the walk is incident to two of the nodes that precede and follow the respective edge. The sentence is created by determining a parent node associated with a selected label word, determining the child nodes of the parent node, determining the edges that are incident to the parent nodes and the child nodes, determining relationship words that describe the edges that are incident to the parent nodes and the child nodes, and determining child label words that describe the child nodes. A selected relationship word and a selected child label word are then added to the sentence. In this way, a walk of the graph may be more easily understood.