Daniel Gerard Wood, 51418 Winding Way, San Carlos, CA 94070

7313785, Dec 25, 2007

Apr 29, 2003

10/426384

Edward Van Gennip - Toronto, CA
Mark F. Wilding - Barrie, CA
Daniel A. Wood - Fremont CA, US

International Business Machines Corporation - Armonk NY

G06F 9/44
G06F 9/45

717130, 717140

The present invention provides a complier and linker for analyzing the structures of complex data stored in memory when a print statement specified in source code refers to those complex data structures, and then generating executable code which will print the complex data when a data processing system executes the executable code.

7447829, Nov 4, 2008

Oct 15, 2003

10/687221

Mark Francis Wilding - Barrie, CA
Daniel Alan Wood - Fremont CA, US

International Business Machines Corporation - Armonk NY

G06F 9/46
G06F 12/00

711 1, 718100, 718104

A method and system in accordance with the present invention comprises a thread stack/thread heap combination, wherein the thread heap is for thread local memory usage and wherein the thread stack and thread heap grow in opposite directions. In the present invention the thread specific heap is allocated next to the thread's stack and grows in the opposite direction from that of the stack. This improvement allows the current space management of thread stacks, which spread out the memory placement of multiple stacks to avoid collision, to also be used for the heaps without additional overhead or complexity. It also allows the existing growth scheme of adding memory pages to the process for the stack to be used again because the growth is simply in the opposite direction. Thread specific heaps eliminate the need for expensive synchronization when allocating from a shared heap in a multiprocessor environment.

2007011, May 24, 2007

Nov 22, 2005

11/285340

Monish Gupta - Santa Clara CA, US
Scott Lashley - Portland OR, US
Daniel Wood - Fremont CA, US

G06F 7/00

707101000

A method and system are provided for maintaining a database index version. The database index includes a secondary node affiliated with each leaf node of the index. The secondary node stores version information for each leaf node. A pointer in a header section of the leaf node connects the leaf node to the secondary node. In addition, a status list is maintained to identify each transaction. At such time as a scan of a database index is conducted and an index item is returned, a computation is conducted using the transaction identifiers in the secondary node, the delete flag in the leaf node, and the status list contents for the scanning transaction. The computation and associated logic will determine whether to accept or reject an item. The method results in returning a correct version of the item as existed at the time of start of the scanning transaction.

2008000, Jan 10, 2008

Sep 23, 2007

11/859780

Edward Van Gennip - Toronto, CA
Mark Wilding - Barrie, CA
Daniel Wood - Fremont CA, US

International Business Machines Corporation - Armonk NY

G06F 3/12

358001150

Linking components of an object code to produce executable code is described. Some components of the object code can be adapted to have an individual copy of a printing object for printing a complex data structure. In some embodiments, the linker comprising an identifier module for recognizing at least one of the object components having an embedded print command corresponding to the individual printing object, the embedded print command for abstracted printing of the complex data structure. In some embodiments, the linker comprising a compare module for comparing two or more identified embedded print commands from the object components, the comparison for determining whether two or more of the identified embedded print commands are identical copies of the individual printing object. In some embodiments, the results of the modules are adapted to define the executable code with at least one executable print command corresponding to the embedded print command.

2011013, Jun 9, 2011

Mar 17, 2010

12/726063

Aditya P. Gurajada - Hyderabad IN, US
Amarnadh Sai Eluri - Maharastra, IN
Vaibhav A. Nalawade - Hadapsar, IN
Jian Wu - Pleasanton CA, US
Daniel Alan Wood - Fremont CA, US
Yanhong Wang - San Ramon CA, US

Sybase, Inc. - Dublin CA

G06F 17/30
G06F 12/06
G06F 12/08

711118, 707803, 711202, 707E17005, 711E12078, 711E12016

System, method, computer program product embodiments and combinations and sub-combinations thereof for managing data storage as an in-memory database in a database management system (DBMS) are provided. In an embodiment, a specialized database type is provided as a parameter of a native DBMS command. A database hosted entirely in-memory of the DBMS is formed when the specialized database type is specified.

2013017, Jul 4, 2013

Dec 30, 2011

13/340826

Ameya Sakhalkar - Bangalore, IN
Anunay Tiwari - Pune, IN
Daniel Alan Wood - Fremont CA, US
Kantikiran Krishna Pasupuleti - Visakhapatnam, IN

Sybase, Inc. - Dublin CA

G06F 12/00

711150, 711E12001

Reducing contentions between processes or tasks that are trying to access shared resources is described herein. According to embodiments of the invention, a method of writing a set of data associated with a task to a memory resource is provided. The method includes calculating the amount of memory required to write said data to the memory resource and updating an expected end marker to reflect the amount of memory required to write the data to the memory resource. A flag is then set to an incomplete state, and the data is written to the memory resource. The flag can be set to a complete state and an end marker is updated. The end marker indicates the end of the data stored in the memory resource.