Search

Stefano Stefani Phones & Addresses

  • 5975 Mont Blanc Pl NW, Issaquah, WA 98027 (206) 856-7047
  • Seattle, WA
  • 3928 165Th Ave, Redmond, WA 98052 (425) 883-4205
  • Kiona, WA

Resumes

Resumes

Stefano Stefani Photo 1

Motion Graphic Designer

Location:
Issaquah, WA
Industry:
Design
Work:
Zoomin.tv
Motion Graphic Designer

Izi.travel Jan 1, 2016 - Jan 2017
Visual Designer

The Warehouse Milkshake Festival Jul 2015 - Dec 2015
Vj and Light Technician and Motion Designer

Oeverloos Stripfestival Sep 2015 - Oct 2015
Executive Creative Director and Graphic Designer

Boschparade 2015 Jan 2015 - Jun 2015
Creative Supervisor and and Motion Graphic and and Compositor
Education:
Alma Mater Studiorum – Università Di Bologna 2001 - 2003
Masters, Master of Arts
Skills:
Visual Effects
Cinema
Culture
Motion Graphics
Video Editing
Photography
Video Mapping
Live Visual
Vjing
After Effects
Commercials
Film
Video
Compositing
New Media
Graphics
Multimedia
Premiere
Adobe Premiere Pro
Interests:
Photography
Cinema
Computer Science and Multimedia
Arts
Languages:
Italian
English
Dutch
Stefano Stefani Photo 2

Vice President And Distinguished Engineer

Location:
Issaquah, WA
Industry:
Internet
Work:
Amazon Web Services
Vice President and Distinguished Engineer

Microsoft Apr 2000 - Dec 2007
Senior Software Engineer

Ibm Feb 1997 - Apr 2000
Software Engineer
Education:
Alma Mater Studiorum – Università Di Bologna 1991 - 1997

Publications

Us Patents

Sql Language Extensions For Modifying Collection-Valued And Scalar Valued Columns In A Single Statement

US Patent:
7433886, Oct 7, 2008
Filed:
Oct 24, 2003
Appl. No.:
10/693302
Inventors:
Balaji Rathakrishnan - Sammamish WA, US
Stefano Stefani - Seattle WA, US
Aleksandras Surna - Redmond WA, US
Jose A. Blakeley - Bothell WA, US
Oliver Nicholas Seeliger - Sammamish WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707103R, 707 2, 707 1, 707 4
Abstract:
A system and method for updating collection-valued and other complex structured columns in a nested table using a nested extension of an UPDATE statement that is analogous to the syntax and semantics of the UPDATE statement that is used to modify scalar-valued columns of the table (called the outer UPDATE). Using the same syntactic and semantic constructs as the table at the outer level allows an existing implementation that processes modifications to relational tables to reuse its implementation techniques for processing outer updates to modify collection-valued columns as well. The UPDATE extensions enable the specification of updates to nested collections embedded at arbitrary levels of depth in the object model. The new syntax is embedded inside the outer UPDATE statement in a way that parallels the structure of the data itself and thus maps more directly to the user's conceptual model of the data.

Systems And Methods For A Large Object Infrastructure In A Database System

US Patent:
7437346, Oct 14, 2008
Filed:
Feb 10, 2004
Appl. No.:
10/776664
Inventors:
Shrinivas Ashwin - Sammamish WA, US
Jose A. Blakeley - Redmond WA, US
Peter Carlin - Seattle WA, US
Jun Fang - Sammamish WA, US
Ajay Kalhan - Redmond WA, US
Christian Kleinerman - Bellevue WA, US
Stefano Stefani - Seattle WA, US
Aleksandras Surna - Redmond WA, US
Honggang Zhang - Bellevue WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 7/00
US Classification:
707 1, 707200, 707 6, 707102
Abstract:
Various embodiments of the present invention are direct to the utilization of Blob Handles (BHs) which are an internal representation of a large value. BHs are immutable and stateless references to a large data object. The structure of a BH contains enough information to return an ILockBytes interface in order to provide access to the corresponding large data block, and a BH can also return information regarding its own lifetime description. A BH can be completely described using (a) a pointer to the beginning of BH data and (b) the byte-length of the BH.

Systems And Methods For The Implementation Of Unordered And Ordered Collections In A Data Store

US Patent:
7437371, Oct 14, 2008
Filed:
Dec 30, 2004
Appl. No.:
11/027416
Inventors:
Balaji Rathakrishnan - Sammamish WA, US
Beysim Sezgin - Redmond WA, US
Denis Y. Altudov - Redmond WA, US
Jose A. Blakeley - Redmond WA, US
Oliver Nicholas Seeliger - Sammamish WA, US
Ramachandran Venkatesh - Bellevue WA, US
Wei Yu - Issaquah WA, US
Dragan Tomic - Redmond WA, US
Denis Churin - Bellevue WA, US
Bruno H. M. Denuit - Bellevue WA, US
Conor J. Cunningham - Redmond WA, US
Stefano Stefani - Seattle WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/00
US Classification:
707100, 707 4, 707200, 717108
Abstract:
Several embodiments of the present invention are directed to systems and methods for extending the UDT framework of an extended relational data store (ERDS) to include support for unordered collections (multisets) and ordered collection (lists). More specifically, several embodiments of the present invention use an UDT infrastructure, CLR generics, and a new UNNEST operator to create and utilize a special type abstraction for collections that is simultaneously a scalar and a relation. As a scalar, this collection type can be processed by all parts of the data store engine that understand scalars (including but not limited to the client stack) and, as a relation, this collection type is queriable like any other type of relation.

Systems And Methods For Fine Grained Access Control Of Data Stored In Relational Databases

US Patent:
7599937, Oct 6, 2009
Filed:
Apr 3, 2007
Appl. No.:
11/696024
Inventors:
Tanmoy Dutta - Sammamish WA, US
Conor Cunningham - Redmond WA, US
Stefano Stefani - Seattle WA, US
Girish Chander - Redmond WA, US
Eric N. Hanson - Bellevue WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707 9, 707 2, 707 4, 707 3, 707100, 709225, 713165, 713201, 713166
Abstract:
A system and method for facilitating secure access to database(s) is provided. The system relates to authorizing discriminatory access to relational database data. More particularly, the invention provides for an innovative technique of defining secured access to rows in relational database tables in a way that cannot be spoofed while preserving various optimization techniques. The invention affords a persistent scheme via providing for a security architecture whereby discriminatory access policies on persistent entities can be defined and enforced while preserving set based associative query capabilities. A particular aspect of the invention relates to the specification of such policies and the technique by which those policies are enforced. With respect to one particular implementation of the invention, creation, modification and deletion of access control lists called security descriptors is provided. The security descriptors can be provisioned independent of rows in tables of the database and can be shared and embody the policy on what permissions are granted to whom when associated with a row.

Method For Efficient Maintenance Of Xml Indexes

US Patent:
7636739, Dec 22, 2009
Filed:
Jun 30, 2005
Appl. No.:
11/171769
Inventors:
Stefano Stefani - Seattle WA, US
Denis V. Churin - Sammamish WA, US
Istvan Cseri - Redmond WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707201, 707 3, 715234
Abstract:
An update to a primary table is received. The primary table is read to determine the set of rows to be updated. The primary table is updated and XML objects stored in XML columns are overwritten according to the update. A pre-update node table comprising the nodes corresponding to the updated rows is created from an XML index table corresponding to the primary table. A post-update node table is created by shredding the updated XML objects. The post-update table and the pre-update table are merged according to their node identifiers. The resulting merged table can be inspected to determine which nodes have been, added, deleted, or updated. Based on this inspection, the necessary additions and deletions can be efficiently made to the XML index table.

Systems And Methods For Avoiding Database Anomalies When Maintaining Constraints And Indexes In Presence Of Snapshot Isolation

US Patent:
7653665, Jan 26, 2010
Filed:
Sep 13, 2004
Appl. No.:
10/940891
Inventors:
Stefano Stefani - Seattle WA, US
Wei Xiao - Redmond WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 12/00
US Classification:
707203, 707202, 709203, 714 19
Abstract:
A system and method avoids anomalies in presence of data manipulation language (DML) plans maintaining dependent objects and snapshot isolation. An anomaly due to using a snapshot isolation level within the transaction is detected within a database transaction and the transaction is aborted based upon that detection. Involved in making the anomaly detection is determining whether a view of particular data accessed during the transaction under a snapshot isolation view to ensure read consistency differs from a view of the data under another isolation level, such as the read committed isolation level. Then a detection is made that an anomaly may occur if it is determined that the view of the data accessed during the transaction under the snapshot isolation differs from the view of the data under the other isolation level. Such anomaly avoidance prevents an indexed view being maintained nor a referential integrity constraint validated based on incorrect data.

Efficient Query Processing Of Merge Statement

US Patent:
7676525, Mar 9, 2010
Filed:
Jul 2, 2007
Appl. No.:
11/772495
Inventors:
Stefano Stefani - Issaquah WA, US
Naveen Prakash - Sammamish WA, US
Craig S. Freedman - Sammamish WA, US
Marcel van der Holst - Issaquah WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 7/00
US Classification:
707808
Abstract:
Disclosed are systems and methods for optimization and efficient processing of MERGE statements. MERGE allows performing a mix of inserts, updates, and deletes in a single statement, and introduces new challenges compared to legacy DML statements, where the kind of action to be performed is hard-coded and known at compile time. Such optimizations may include Halloween Protection detection for MERGE statements, optimized prevention of non-deterministic MERGE statements, in-place inserts for MERGE statements scanning the “Read Instance” of the target table, and optimized execution of MERGE statements seeking the “Read Instance” of the target table. Such optimizations may be fundamental in order to ensure proper performance and reliable processing times.

Optimization Of Performing Query Compilations

US Patent:
7739268, Jun 15, 2010
Filed:
Mar 29, 2006
Appl. No.:
11/392267
Inventors:
Conor J. Cunningham - Bothell WA, US
Stanislav A. Oks - Kirkland WA, US
Stefano Stefani - Seattle WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 7/00
G06F 17/30
G06F 13/00
G06F 13/28
US Classification:
707718, 707719, 711170, 711173
Abstract:
Implementations of various technologies for compiling a query. In one implementation, the memory consumption of the query may be monitored. If the amount of memory consumed by the query exceeds one or more gateway thresholds, then the query may be processed to acquire one or more gateways. The query may then be compiled as having acquired the one or more gateways.

Isbn (Books And Publications)

Mathematics for Technologists in Radiology, Nuclear Medicine, and Radiation Therapy

Author

Stefano S. Stefani

ISBN #

0801647622

Stefano Stefani from Issaquah, WA, age ~55 Get Report