Search

Adrian Ilcu Predescu

from Sammamish, WA
Age ~50
Get Report
Also known as:
Adrian I Predescu, Predescu Adrian Ilcu
Phone and address:
109 242Nd Ave SE, Redmond, WA 98074
Related to:
Simona Predescu, 50
Connected to:
Constantin Predescu, 65Dan N Predescu, 75Lucian Predescu, 66Janet S Predieri, 76Rachel K Predieri, 32Sharon J Prediger, 84Clarel Predium, 38Lionel J Predium, 50Mark Predki, 32Kathie L Predko, 75

Adrian Predescu Phones & Addresses

  • 109 242Nd Ave SE, Sammamish, WA 98074
  • 15606 40Th St, Redmond, WA 98052
  • Bellevue, WA
  • Kiona, WA

Work

Company: Orange romania s.a. Position: Ip network architect

Education

School / High School: Universitatea „Politehnica” din București 1997 to 2002

Industries

Telecommunications

Resumes

Resumes

Adrian Predescu Photo 1

Ip Network Architect At Orange Romania S.a.

View page
Position:
IP Network Architect at Orange Romania S.A.
Location:
Bucharest, Romania
Industry:
Telecommunications
Work:
Orange Romania S.A.
IP Network Architect
Datanet Systems Sep 2002 - Jan 2006
Security Consultant
Universal Card Systems May 2002 - Sep 2002
Software Engineer
Logic Telecom SA 2001 - 2002
NOC Engineer
Education:
Universitatea „Politehnica” din București 1997 - 2002

Publications

Us Patents

Efficient Large-Scale Filtering And/Or Sorting For Querying Of Column Based Data Encoded Structures

View page
US Patent:
20100088315, Apr 8, 2010
Filed:
Jan 30, 2009
Appl. No.:
12/363637
Inventors:
Amir Netz - Bellevue WA, US
Cristian Petculescu - Redmond WA, US
Adrian Ilcu Predescu - Sammamish WA, US
Marius Dumitru - Sammamish WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 17/30
US Classification:
707737, 707E17014
Abstract:
The subject disclosure relates to querying of column based data encoded structures enabling efficient query processing over large scale data storage, and more specifically with respect to complex queries implicating filter and/or sort operations for data over a defined window. In this regard, in various embodiments, a method is provided that avoids scenarios involving expensive sorting of a high percentage of, or all, rows, either by not sorting any rows at all, or by sorting only a very small number of rows consistent with or smaller than a number of rows associated with the size of the requested window over the data. In one embodiment, this is achieved by splitting an external query request into two different internal sub-requests, a first one that computes statistics about distribution of rows for any specified WHERE clauses and ORDER BY columns, and a second one that selects only the rows that match the window based on the statistics.

Translating Functional Graph Traversal Language To Extended Structured Query Language

View page
US Patent:
20210034615, Feb 4, 2021
Filed:
Jan 25, 2019
Appl. No.:
16/964085
Inventors:
- Redmond WA, US
Thomas Moscibroda - Beijing, CN
Shireesh K. Thota - Redmond WA, US
Jayanta Mondal - Hyattsville MD, US
Adrian I. Predescu - Redmond WA, US
Oliver D. Towers - Redmond WA, US
International Classification:
G06F 16/2452
G06F 16/901
Abstract:
In embodiments of the present disclosure, there is provided a scheme for translating a functional graph traversal language to an extended Structured Query Language (SQL). After a first query compiled with the functional graph traversal language is obtained, the first query is translated to a second query in the form of the extended Structured Query Language based on the translating rules. By extending the standard Structured Query Language, embodiments of the present disclosure enable retaining directed edges between vertices in the graph database in the second query and retaining flow control, iteration, temporary variable definition, advanced data structure, side effect, and dependency between steps included in the first query. Therefore, according to embodiments of the present disclosure, by translating the functional graph traversal language, it is possible to identify queries with the same semantics in the functional graph traversal language, thereby optimizing queries in the functional graph traversal language.

Schema-Agnostic Indexing Of Distributed Databases

View page
US Patent:
20190340273, Nov 7, 2019
Filed:
May 29, 2018
Appl. No.:
15/991786
Inventors:
- Redmond WA, US
Momin Mahmoud Al-Ghosien - Sammamish WA, US
Samer Boshra - Woodinville WA, US
Brandon Chong - Kirkland WA, US
Madhan Gajendran - Bengaluru, IN
Mikhail Mikhailovich Koltachev - Redmond WA, US
Aravind Ramachandran Krishna - Kirkland WA, US
Emily Lawton - Seattle WA, US
Liang Li - Sammamish WA, US
Karan Vishwanath Popali - Bellevue WA, US
Adrian Ilcu Predescu - Sammamish WA, US
Ankur Savailal Shah - Redmond WA, US
Pankaj Sharma - Kirkland WA, US
Dharma Shukla - Bellevue WA, US
Hari Sudan Sundar - Redmond WA, US
Krishnan Sundaram - Bellevue WA, US
Shireesh Kumar Thota - Redmond WA, US
International Classification:
G06F 17/30
H04L 29/08
Abstract:
Data sets such as databases are often distributed over a number of servers, where each server stores a subset of records and an index that enables the server to locate the records in response to queries. However, tight coupling of indexing and storage may limit load-balancing, fault recovery, and distribution. Instead, the set of servers may be partitioned into a set of storage servers that store the records and a set of index servers of the index over the records. In a set that is decoupled in this manner, load-balancing may involve provisioning and locating index servers independently of the provisioning and locating of the storage servers in view of the particular sensitivities and tolerances of various applications. Additionally, the index servers may also utilize a data layout that is selected and adapted independent of the data layout of the storage servers and/or the schema of the data stored thereby.

Unified Data Organization For Multi-Model Distributed Databases

View page
US Patent:
20190340291, Nov 7, 2019
Filed:
May 29, 2018
Appl. No.:
15/991880
Inventors:
- Redmond WA, US
Momin Mahmoud AL-GHOSIEN - Sammamish WA, US
Samer BOSHRA - Woodinville WA, US
Brandon CHONG - Kirkland WA, US
Madhan GAJENDRAN - Bengaluru, IN
Mikhail Mikhailovich KOLTACHEV - Redmond WA, US
Orestis KOSTAKIS - Bellevue WA, US
Aravind Ramachandran KRISHNA - Kirkland WA, US
Liang LI - Sammamish WA, US
Jayanta MONDAL - Seattle WA, US
Balachandar PERUMALSWAMY - Kirkland WA, US
Karan Vishwanath POPALI - Bellevue WA, US
Adrian Ilcu PREDESCU - Sammamish WA, US
Vivek RAVINDRAN - Redmond WA, US
Ankur Savailal SHAH - Redmond WA, US
Pankaj SHARMA - Kirkland WA, US
Dharma SHUKLA - Bellevue WA, US
Ashwini SINGH - Bellevue WA, US
Vinod SRIDHARAN - Redmond WA, US
Hari Sudan SUNDAR - Redmond WA, US
Krishnan SUNDARAM - Bellevue WA, US
Shireesh Kumar THOTA - Redmond WA, US
Oliver Drew Leonard TOWERS - Seattle WA, US
Siddhesh Dilip VETHE - Redmond WA, US
International Classification:
G06F 17/30
Abstract:
Databases are often provided according to various organizational models (e.g., document-oriented storage, key/value stores, and relational database), and are accessed through various access models (e.g., SQL, XPath, and schemaless queries). As data is shared across sources and applications, the dependency of a data service upon a particular organizational and/or access models may become confining. Instead, data services may store data in a base representation format, such as an atom-record-sequence model. New data received in a native item format may be converted into the base representation format for storage, and converted into a requested format to fulfill data requests. Queries may be translated from a native query format into a base query format that is applicable to the base representation format of the data set, e.g., via translation into an query intermediate language (such as JavaScript) and compilation into opcodes that are executed by a virtual machine within the database engine.
Control profile
Adrian Ilcu Predescu from Sammamish, WA, age ~50 Get Report