Search

Mark E Callaghan

from Rocklin, CA
Age ~49
Get Report
Also known as:
Mark Edward Callaghan, Mark S Callaghan
Related to:
Emily M Cervino, 54Everett L Callaghan, 82Jack E Sadler, 85Robert Vincent Aquino, 53Shari A Sadler, 83David W Gardner, 59Julia M Callaghan, 77Stacie L Gardner, 54
Connected to:
Betti Callaghan, 92Bryan C Callaghan, 53Danielle R Callaghan, 40Deirdre Callaghan, 49Denis K Callaghan, 63Edwina A Callaghan, 75Jefferson D Callaghan, 52Kelsey L Callaghan, 33Klint R Callaghan, 50Lawrence C Callagher, 81

Mark Callaghan Phones & Addresses

  • Rocklin, CA
  • 1159 Parma Dr, San Jose, CA 95120 (408) 268-4434
  • Lincoln, CA
  • Incline Village, NV
  • Flagstaff, AZ

Work

Company: Molecular ecology lab, csumb - Seaside, CA Jan 2011 Position: Undergraduate researcher

Education

School / High School: California State University Monterey Bay- Seaside, CA May 2014 Specialities: Bachelor of Science in Biology

Resumes

Resumes

Mark Callaghan Photo 1

President

View page
Location:
San Francisco, CA
Industry:
Machinery
Work:
Sj Die Casting and Machining Corp
President
San Jose Die Casting Corp
Vice President Mfg
Education:
University of Nevada, Reno 1993 - 1997
Bachelors, Bachelor of Science, Mechanical Engineering
Skills:
Manufacturing
Continuous Improvement
Product Development
Strategic Planning
Lean Manufacturing
Manufacturing Operations Management
Supply Chain Management
Engineering
Process Improvement
Program Management
Sales Management
Customer Service
Cross Functional Team Leadership
Product Management
Value Stream Mapping
Sourcing
Mark Callaghan Photo 2

Mark Callaghan

View page
Mark Callaghan Photo 3

Mark Callaghan

View page
Mark Callaghan Photo 4

Mark Callaghan

View page
Mark Callaghan Photo 5

Mark Callaghan

View page
Mark Callaghan Photo 6

Mark Callaghan Irvine, CA

View page
Work:
Molecular Ecology Lab, CSUMB
Seaside, CA
Jan 2011 to May 2013
Undergraduate Researcher
Molecular Ecology Lab, CSUMB
Friday Harbor, WA
Jun 2012 to Aug 2012
Lab Assistant
Molecular Ecology Lab, CSUMB
Seaside, CA
Oct 2011 to Apr 2012
IT assistant
Molecular Ecology Lab, CSUMB
Anacortes, WA
Jun 2011 to Aug 2011
Undergraduate Researcher
Western Kentucky University
Bowling Green, KY
May 2010 to Aug 2010
Undergraduate Researcher
Education:
California State University Monterey Bay
Seaside, CA
May 2014
Bachelor of Science in Biology
Seattle University
Seattle, WA
Sep 2008 to Dec 2008
Bachelor of Arts in Biology
Jesuit High School
Carmichael, CA
May 2008

Publications

Us Patents

Encoding Data To Be Sorted

View page
US Patent:
7587396, Sep 8, 2009
Filed:
Nov 24, 2004
Appl. No.:
10/996742
Inventors:
Mark D. Callaghan - Palo Alto CA, US
Dmitry M. Potapov - Emerald Hills CA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 17/30
US Classification:
707 7, 707 6
Abstract:
Key conditioning involves the construction of a byte orderable array from values for a possibly multi-field key concatenated key, for comparison by a sort routine. Byte-orderable sort keys are conditioned prior to execution of a sort routine, to facilitate an accurate and/or efficient sort procedure. For example, key conditioning may be applied to values in one or more columns of a database table, where the column(s) are used as keys for sorting rows of the table. Six factors are considered in encoding the byte array, such as whether nulls compare high or low; whether a field is fixed width or variable width; whether a field is guaranteed to be not null; whether a field is ordered ascending or descending; whether a field is the last field of a multi-field sort key or the only field of a sort key; and whether a field is likely to contain a significant number of zero values.

Method For Sorting Data Using Common Prefix Bytes

View page
US Patent:
7680791, Mar 16, 2010
Filed:
Jan 18, 2005
Appl. No.:
11/039024
Inventors:
Mark D. Callaghan - Palo Alto CA, US
Wei Z. Li - San Carlos CA, US
William H. Waddington - Foster City CA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 17/30
G06F 15/16
US Classification:
707 7
Abstract:
Several techniques for sorting item are described, generally referred to as (1) common prefix skipping quicksort; (2) key substring caching; and (3) adaptive quicksort. With common prefix skipping quicksort, common prefix bytes among all key values for a partition are computed while performing a quicksort partitioning operation, and the known common bytes are skipped when comparing two key values in a recursive partitioning operation. With key substring caching, each item is represented in a cached array comprising a particular number of bytes for respective portions of key values (“key substring”), where the key substring cache is updated contain bytes beyond the known number of common prefix bytes. An adaptive quicksort routine is a hybrid of a quicksort function and most significant digit radix sort function, where the functions are mutually recursive.

Dynamic Selection Of Frequent Itemset Counting Technique

View page
US Patent:
7720790, May 18, 2010
Filed:
Aug 18, 2003
Appl. No.:
10/643563
Inventors:
Wei Li - Redwood City CA, US
Jiansheng Huang - Daly City CA, US
Ari Mozes - San Carlos CA, US
Shiby Thomas - Nashua NH, US
Mark Douglas Callaghan - Foster City CA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 17/30
G06F 7/00
US Classification:
707 3, 707 2, 7071041
Abstract:
Techniques are provided for (1) extending SQL to support direct invocation of frequent itemset operations, (2) improving the performance of frequent itemset operations by clustering itemset combinations to more efficiently use previously produced results, and (3) making on-the-fly selection of the occurrence counting technique to use during each phase of a multiple phase frequent itemset operation. When directly invoked in an SQL statement, a frequent itemset operation may receive input from results of operations specified in the SQL statement, and provide its results directly to other operations specified in the SQL statement. By clustering itemset combinations, resources may be used more efficiently by retaining intermediate information as long as it is useful, and then discarding it to free up volatile memory. Dynamically selecting an occurrence counting technique allows a single frequent itemset operation to change the occurrence counting technique that it is using midstream, based on cost considerations and/or environmental conditions.

Encoding Data To Be Sorted

View page
US Patent:
8631020, Jan 14, 2014
Filed:
Jul 20, 2009
Appl. No.:
12/506120
Inventors:
Mark D. Callaghan - Palo Alto CA, US
Dmitry M. Potapov - Emerald Hills CA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 7/00
G06F 17/30
US Classification:
707752, 707801
Abstract:
Key conditioning involves the construction of a byte orderable array from values for a possibly multi-field key concatenated key, for comparison by a sort routine. Byte-orderable sort keys are conditioned prior to execution of a sort routine, to facilitate an accurate and/or efficient sort procedure. Key conditioning may be applied to values in one or more columns of a database table, where the column(s) are used as keys for sorting rows of the table. Six factors are considered in encoding the byte array, such as whether nulls compare high or low; whether a field is fixed width or variable width; whether a field is guaranteed to be not null; whether a field is ordered ascending or descending; whether a field is the last field of a multi-field sort key or the only field of a sort key; and whether a field is likely to contain a significant number of zero values.

Encoding Data To Be Sorted

View page
US Patent:
20090282040, Nov 12, 2009
Filed:
Jul 20, 2009
Appl. No.:
12/506126
Inventors:
Mark D. Callaghan - Palo Alto CA, US
Dmitry M. Potapov - Emerald Hills CA, US
International Classification:
G06F 7/08
G06F 17/30
US Classification:
707 7, 707 6, 707E17107
Abstract:
Key conditioning involves the construction of a byte orderable array from values for a possibly multi-field key concatenated key, for comparison by a sort routine. Byte-orderable sort keys are conditioned prior to execution of a sort routine, to facilitate an accurate and/or efficient sort procedure. For example, key conditioning may be applied to values in one or more columns of a database table, where the column(s) are used as keys for sorting rows of the table. Six factors are considered in encoding the byte array, such as whether nulls compare high or low; whether a field is fixed width or variable width; whether a field is guaranteed to be not null; whether a field is ordered ascending or descending; whether a field is the last field of a multi-field sort key or the only field of a sort key; and whether a field is likely to contain a significant number of zero values.

Tiered Data Storage Architecture

View page
US Patent:
20160019254, Jan 21, 2016
Filed:
Jul 16, 2014
Appl. No.:
14/333391
Inventors:
- Menlo Park CA, US
Hongzhong Jia - Cupertino CA, US
Jason Taylor - Berkeley CA, US
Mark Douglas Callaghan - Bend OR, US
Domas Mituzas - Palo Alto CA, US
International Classification:
G06F 17/30
Abstract:
The disclosure is directed to storing data in different tiers of a database based on the access pattern of the data. Immutable data, e.g., data that does not change or changes less often than a specified threshold, is stored in a first storage tier of the database, and mutable data, e.g., data that changes more often than immutable data, is stored in a second storage tier of the database. The second storage tier of the database is more performant than the first storage tier, e.g., the second storage tier has a higher write endurance and a lower write latency than the first storage tier. All writes to the database are performed at the second storage tier and reads on both storage tiers. The storage tiers are synchronized, e.g., the set of data is copied from the second to the first storage tier based on a trigger, e.g., a specified schedule.
Control profile
Mark E Callaghan from Rocklin, CA, age ~49 Get Report