Search

Neil Sharman Phones & Addresses

  • Sammamish, WA
  • Bellevue, WA
  • Minneapolis, MN
  • Kiona, WA
  • 52 210Th Pl NE, Sammamish, WA 98074 (425) 968-2592

Work

Company: Microsoft Feb 2008 Position: Principal software development engineer

Education

Degree: Master of Science, Masters School / High School: University of Canterbury 1985 to 1992

Skills

.Net • Software Engineering • Software Development • Scalability • Software Design • Multithreading • C++ • Distributed Systems • Algorithms • C# • Xml • Software Architectural Design • Web Services • Agile Methodologies • Search Engine Technology • Programming • Machine Learning • Object Oriented Design

Industries

Computer Software

Public records

Vehicle Records

Neil Sharman

View page
Address:
52 210 Pl NE, Sammamish, WA 98074
VIN:
JTDKB20U083361207
Make:
TOYOTA
Model:
PRIUS
Year:
2008

Resumes

Resumes

Neil Sharman Photo 1

Software Engineer

View page
Location:
Sammamish, WA
Industry:
Computer Software
Work:
Microsoft
Principal Software Development Engineer

Saic Oct 2005 - Dec 2007
Senior Software Engineer

Rmit University 1993 - Sep 2005
Senior Software Engineer

University of Melbourne 1992 - 1993
Software Engineer

University of Canterbury 1985 - 1992
Student
Education:
University of Canterbury 1985 - 1992
Master of Science, Masters
Skills:
.Net
Software Engineering
Software Development
Scalability
Software Design
Multithreading
C++
Distributed Systems
Algorithms
C#
Xml
Software Architectural Design
Web Services
Agile Methodologies
Search Engine Technology
Programming
Machine Learning
Object Oriented Design

Publications

Us Patents

Hierarchical Merging For Optimized Index

View page
US Patent:
8239391, Aug 7, 2012
Filed:
Jul 13, 2010
Appl. No.:
12/835396
Inventors:
Jay Kumar Goyal - Bellevue WA, US
Neil Sharman - Sammamish WA, US
Vibhaakar Sharma - Redmond WA, US
Vinay Sudhir Deshpande - Bellevue WA, US
Utkarsh Jain - Bellevue WA, US
Gaurav Sareen - Sammamish WA, US
Yinzhe Yu - Bellevue WA, US
Daniel Yuan - Sammamish WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 7/00
US Classification:
707746
Abstract:
Methods, systems, and media are provided for an optimized search engine index. The optimized index is formed by merging small lower level indexes of fresh documents together into a hierarchical cluster of multiple higher level indexes. The optimized index of fresh documents is formed via a single threaded process, while a fresh index serving platform concurrently serves fresh queries. The hierarchy of higher level indexes is formed by merging lower and/or higher level indexes with similar expiration times together. Therefore, as some indexes expire, the remaining un-expired indexes can be re-used and merged with new incoming indexes. The single threaded process provides fast serving of fresh documents, while also providing time to integrate the fresh indexes into a long term primary search engine index, prior to expiring.

Detecting Spiking Queries

View page
US Patent:
20110179017, Jul 21, 2011
Filed:
Jan 20, 2010
Appl. No.:
12/690184
Inventors:
CHRISTOPHER AVERY MEYERS - KIRKLAND WA, US
GOPI PRASHANTH GOPAL - REDMOND WA, US
ANDREW PETER OAKLEY - SEATTLE WA, US
NITIN AGRAWAL - REDMOND WA, US
NICHOLAS ERIC CRASWELL - REDMOND WA, US
MILAD SHOKOUHI - CAMBRIDGE, GB
DERRICK LESLIE CONNELL - BELLEVUE WA, US
SANAZ AHARI - KIRKLAND WA, US
NEIL BRUCE SHARMAN - SAMMAMISH WA, US
GAURAV SAREEN - SAMMAMISH WA, US
HUGH EVAN WILLIAMS - SARATOGA CA, US
JAY KUMAR GOYAL - BELLEVUE WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 17/30
G06F 21/00
G06Q 30/00
US Classification:
707722, 726 23, 705 1452, 707E17014
Abstract:
Methods, systems, and media are provided for identifying and clustering queries that are rising in popularity. Resultant clustered queries can be compared to other stored queries using textual and temporal correlations. Fresh indices containing information and results from recently crawled content sources are searched to obtain the most recent query activity. Historical indices are also searched to obtain temporally correlated information and results that match the clustered query stream. A weighted average acceleration of a spike can be calculated to distinguish between a legitimate spike and a non-legitimate spike. Legitimate clusters are combined with other stored clusters and presented as grouped content results to a user output device.

Receiving Individual Documents To Serve

View page
US Patent:
20120257246, Oct 11, 2012
Filed:
Apr 8, 2011
Appl. No.:
13/082990
Inventors:
DANIEL YUAN - SAMMAMISH WA, US
NEIL SHARMAN - SAMMAMISH WA, US
JAY GOYAL - BELLEVUE WA, US
UTKARSH JAIN - BELLEVUE WA, US
VIBHAAKAR SHARMA - REDMOND WA, US
VINAY DESHPANDE - BELLEVUE WA, US
OREN FIRESTEIN - REDMOND WA, US
Assignee:
MICROSOFT CORPORATION - REDMOND WA
International Classification:
G06F 3/12
US Classification:
358 115
Abstract:
Methods and systems for quickly serving documents are provided. Documents may be served to users, for example, in response to search query inputs. Documents may be individually communicated to a document server prior to batching the documents. By individually communicating documents to document servers, the document experiences sub-second latency before it is available to a user. The documents may also be modified individually such that real-time serving is not interrupted.

Lock-Free Indexing Of Documents

View page
US Patent:
20120259860, Oct 11, 2012
Filed:
Apr 8, 2011
Appl. No.:
13/082997
Inventors:
NEIL SHARMAN - SAMMAMISH WA, US
VIBHAAKAR SHARMA - REMOND WA, US
Assignee:
MICROSOFT CORPORATION - REDMOND WA
International Classification:
G06F 17/30
US Classification:
707741, 707769, 707E17014, 707E17002
Abstract:
Methods and systems for serving documents are provided. Documents may be served to users, for example, in response to search query inputs. Documents may be individually received for serving to users. In order to serve documents, documents are typically indexed. To serve documents in a real-time environment, a data structure is configured to index documents that are received while simultaneously being queried for documents to serve to a user. Documents that have not yet completed the indexing process are not available for serving and, thus, are not queried. Additionally, the data structure includes a memory optimizer such that indexing does not waste memory of the data structure.

Recovery Of A Document Serving Environment

View page
US Patent:
20120260124, Oct 11, 2012
Filed:
Apr 8, 2011
Appl. No.:
13/082912
Inventors:
DANIEL YUAN - SAMMAMISH WA, US
NEIL SHARMAN - SAMMAMISH WA, US
JAY GOYAL - BELLEVUE WA, US
UTKARSH JAIN - BELLEVUE WA, US
VIBHAAKAR SHARMA - REMOND WA, US
VINAY DESHPANDE - BELLEVUE WA, US
Assignee:
MICROSOFT CORPORATION - REDMOND WA
International Classification:
G06F 15/173
G06F 11/20
US Classification:
714 411, 709224, 714E11073
Abstract:
Methods and systems for quickly serving documents are provided. Documents may be served to users, for example, in response to search query inputs. Documents may be individually communicated to a document server individually prior to batching the documents. In such a real-time serving system, serving components may fail. To ensure real-time serving despite the failure, spares are utilized to replace the failing serving components such that the spare can immediately begin receiving documents. The spare can also be synchronized with other serving components to obtain the memory of the failing serving component prior to the failure.
Neil B Sharman from Sammamish, WA, age ~57 Get Report