Patents by Inventor vivek RAVINDRAN

vivek RAVINDRAN has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 10970270
    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.
    Type: Grant
    Filed: May 29, 2018
    Date of Patent: April 6, 2021
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Karthik Raman, Momin Mahmoud Al-Ghosien, Samer Boshra, Brandon Chong, Madhan Gajendran, Mikhail Mikhailovich Koltachev, Orestis Kostakis, Aravind Ramachandran Krishna, Liang Li, Jayanta Mondal, Balachandar Perumalswamy, Karan Vishwanath Popali, Adrian Ilcu Predescu, Vivek Ravindran, Ankur Savailal Shah, Pankaj Sharma, Dharma Shukla, Ashwini Singh, Vinod Sridharan, Hari Sudan Sundar, Krishnan Sundaram, Shireesh Kumar Thota, Oliver Drew Leonard Towers, Siddhesh Dilip Vethe
  • Publication number: 20190340291
    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.
    Type: Application
    Filed: May 29, 2018
    Publication date: November 7, 2019
    Inventors: Karthik RAMAN, Momin Mahmoud AL-GHOSIEN, Samer BOSHRA, Brandon CHONG, Madhan GAJENDRAN, Mikhail Mikhailovich KOLTACHEV, Orestis KOSTAKIS, Aravind Ramachandran KRISHNA, Liang LI, Jayanta MONDAL, Balachandar PERUMALSWAMY, Karan Vishwanath POPALI, Adrian Ilcu PREDESCU, Vivek RAVINDRAN, Ankur Savailal SHAH, Pankaj SHARMA, Dharma SHUKLA, Ashwini SINGH, Vinod SRIDHARAN, Hari Sudan SUNDAR, Krishnan SUNDARAM, Shireesh Kumar THOTA, Oliver Drew Leonard TOWERS, Siddhesh Dilip VETHE
  • Publication number: 20160217479
    Abstract: Methods and systems for recommending limited, personalized and relevant list of prospects to enterprises, in a configurable, automated, scalable and machine-learnt way. According to one embodiment, raw data about potential prospects across diverse areas is collected from various data sources. The raw data is transformed to variables containing values in a binary format, also known as interests, in accordance with a predetermined set of rules. An interest graph is created with the interests as nodes and affinity between them as edges and net affinities are calculated and stored in an interest table. The user's requirements are understood through user input and a set of user-relevant interests is captured and extended with additional similar interests from the interest table. Multiple scores are calculated for each of the potential prospects based on this set of interests. A net score for each potential prospect is calculated and highest potential prospects are finally recommended.
    Type: Application
    Filed: February 4, 2015
    Publication date: July 28, 2016
    Inventors: AJAY KASHYAP, sANDEEP GURUVINDAPALLI, vivek RAVINDRAN