Concurrent Read/write Management Using Locks Patents (Class 707/704)
  • Patent number: 10331688
    Abstract: A method for searching data on multiple domains includes transmitting a search query to an enterprise domain; receiving, from the enterprise domain, enterprise content matching the search query; receiving, from the enterprise domain, a search query normalized for searching a social site domain, the normalized search query being the search query in a format recognizable by the social site domain; transmitting the normalized search query to the social site domain; and receiving, from the social site domain, social site content matching the normalized search query.
    Type: Grant
    Filed: January 29, 2015
    Date of Patent: June 25, 2019
    Assignee: HYLAND SWITZERLAND SÀRL
    Inventors: Thomas David Montgomery, Derek Cunninghame Murphy, Benjamin Stephen Truscott
  • Patent number: 10311411
    Abstract: A computing device for facilitating transactions between one or more remote devices, the device comprising a processing module arranged to interact with the one or more remote devices via a communications network and a database arranged to contain information regarding the state of one or more transaction channels in relation to an account, wherein the module is arranged to receive instructions via the communications network from the one or more remote devices and provide information regarding the state of the one or more transaction channels is disclosed.
    Type: Grant
    Filed: January 4, 2013
    Date of Patent: June 4, 2019
    Assignee: EINNOVATIONS HOLDINGS PTE. LTD.
    Inventor: Alex D. Ibasco
  • Patent number: 10311039
    Abstract: An optimized skiplist iterator technique for RCU-protected skiplists. A skiplist iterator operation may attempt to validate a cached pointer hint that references a skiplist element of an RCU-protected skiplist, the skiplist element having an associated first key. If the pointer hint is validated, the pointer hint may be dereferenced to access the skiplist element. A pointer in the skiplist element may be dereferenced to advance to a next skiplist element of the RCU-protected skiplist, the next skiplist element having an associated second key that is larger than the first key. If the pointer hint is not validated, a value-based skiplist iterator operation may be performed that includes traversing the RCU-protected skiplist using the first key to find the next skiplist element having the second key. A new pointer hint that references the next skiplist element may be cached for use in a next invocation of the skiplist iterator operation.
    Type: Grant
    Filed: December 7, 2016
    Date of Patent: June 4, 2019
    Assignee: International Business Machines Corporation
    Inventors: Paul E. McKenney, Manuel Mayr
  • Patent number: 10303680
    Abstract: According to one embodiment, a data processing apparatus is applied to a data management system. The data processing apparatus is connected to a client terminal, a first storage medium and a second storage medium to be capable of communicating with the client terminal and the first and second storage mediums. The first storage medium stores a plurality of tables which are identified by table names and include a plurality of column names and columns corresponding to the column names, respectively. The second storage medium stores some data in the tables stored in the first storage medium and keys for use in reading out the data, in association with each other.
    Type: Grant
    Filed: July 28, 2016
    Date of Patent: May 28, 2019
    Assignee: KABUSHIKI KAISHA TOSHIBA
    Inventor: Akifumi Murata
  • Patent number: 10289459
    Abstract: A system and method for event-driven live migration of applications between two or more servers. Primary applications runs on primary hosts and one or more replicated instances of each primary application run on one or more backup hosts. Event driven live migration is provided through a combination of process replication, logging, barrier synchronization, reliable messaging and message playback. The event driven live migration is transparent to the application and requires no modification to the application, operating system, networking stack or libraries.
    Type: Grant
    Filed: May 27, 2016
    Date of Patent: May 14, 2019
    Assignee: OPEN INVENTION NETWORK LLC
    Inventor: Allan Havemose
  • Patent number: 10282230
    Abstract: An updater needing an expedited RCU grace period may initiate a leaf-to-root traversal of a funnel lock embodied as a hierarchical tree of nodes. For each accessed node, the updater may check an indicator to determine if another updater needing the same expedited grace period has visited the node. If true, the updater may add itself to a waitqueue of updaters waiting for the expedited RCU grace period. If false, the updater may set the indicator to indicate it has visited the node, and then continue to a next node. If the updater reaches the root node with no indication that any other updater needing the expedited RCU grace period has visited the nodes accessed by the updater, the updater may, while holding a mutex lock, start a new expedited RCU grace period and at the end thereof wake up other updaters waiting on the expedited RCU grace period.
    Type: Grant
    Filed: October 3, 2016
    Date of Patent: May 7, 2019
    Assignee: International Business Machines Corporation
    Inventor: Paul E. McKenney
  • Patent number: 10263977
    Abstract: An example method for migrating communication data from a source server to a target server includes obtaining, using a computing device, a set of credentials to access the source server, and accessing the source server using the set of credentials. The method also includes requesting, automatically by the computing device, a directory structure associated with communication data from the source server, populating, by the computing device, the target server using the directory structure, requesting the communication data from the source server, and populating the target server with the communication data.
    Type: Grant
    Filed: September 18, 2017
    Date of Patent: April 16, 2019
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Kutlay Topatan, Maxim Ivanov, Victor Boctor, Palash Biswas, Bernard Luke Gallagher
  • Patent number: 10248494
    Abstract: A lightweight always-on monitoring, collecting, diagnosing, and correcting utility operates in an enhanced storage manager that manages a data storage managements system. The always-on utility provides a comprehensive and pro-active approach, which is intended to reduce, if not altogether eliminate, the need for after-the-fact diagnostics. The always-on utility also enforces so-called best practices and other heuristics, which include pro-actively activating certain database settings that are not enabled by default; manipulating certain aspects of the database to improve performance; and reporting aspects that are outside best-practice parameters to the trouble report system so that system administrators and/or developers may intervene before a catastrophic failure occurs. In some cases, the best-practice parameters represent heuristics designed by the present inventors to improve the performance and general health of the management database.
    Type: Grant
    Filed: October 25, 2016
    Date of Patent: April 2, 2019
    Assignee: Commvault Systems, Inc.
    Inventors: Ganesh Haridas, Sundar Narasimman, Karthik Suriyanarayanan, Gunassekaran A S, Michael Frank Klose
  • Patent number: 10241842
    Abstract: Cloud container resource binding and tasking using keys is generally described herein. An example device to bind and perform tasks using cloud-based resource may include a container to claim tasks to be performed and to select and bind to a resource based on capabilities of the resource and requirements of the tasks.
    Type: Grant
    Filed: September 29, 2016
    Date of Patent: March 26, 2019
    Assignee: Intel Corporation
    Inventors: Ned M. Smith, David W. Grawrock
  • Patent number: 10223386
    Abstract: A computer-implemented method for improving database management includes selecting one or more database records that are requested based on a query statement. The one or more database records may are read from a first database file. The one or more database records are copied from the first database file and stored to a memory. The one or more database records are deleted from the first database file at substantially the same time as the reading the one or more database records. The reading and the deleting occur through a single read and delete input/output (I/O) operation.
    Type: Grant
    Filed: December 28, 2017
    Date of Patent: March 5, 2019
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Patent number: 10204130
    Abstract: A method, a processing device, and a computer program product are provided. A truncate table command for truncating all or a subset of one or more rows of a database table is received from a first transaction executing on a processing device. At least one read operation on the truncated database table is performed for at least one transaction concurrent with the first transaction, wherein the truncated rows are visible to the at least one concurrent transaction and invisible to subsequent transactions. Storage units that store the truncated rows are reclaimed in response to completion of the at least one concurrent transaction.
    Type: Grant
    Filed: March 23, 2016
    Date of Patent: February 12, 2019
    Assignee: International Business Machines Corporation
    Inventors: Praveen Mohandas, Sunil K. Sarin, Knut Stolze
  • Patent number: 10191963
    Abstract: Techniques are described for prefetching analytic results across multiple levels of a dimension in a multidimensional dataset. In some embodiments, an application layer sends a request to view a summary of a multidimensional dataset, where the request targets a first level of a particular dimension of the multidimensional dataset. In response to receiving the request, a pre-fetch range is determined. The pre-fetch range identifies how many levels to analyze along the particular dimension of the multidimensional dataset. At least one analytical operation is performed for the first level of the particular dimension and one or more levels that are within the pre-fetch range of the first level. A first analytic result for the first level is returned to the application layer. For each respective level of the one or more levels within the pre-fetch range, a respective analytic result is stored in a cache.
    Type: Grant
    Filed: February 29, 2016
    Date of Patent: January 29, 2019
    Assignee: Oracle International Corporation
    Inventors: Xiaolan Shen, Sangeeta Dattawadkar, Edwin Meijer, Aravindan Vijayan
  • Patent number: 10191952
    Abstract: A system includes one or more memory devices storing instructions, and one or more processors configured to execute the instructions to perform steps of a method for processing a large file. The system may receive record data comprising a plurality of records having an identification value in a common field having a data format. The system may determine a plurality of focus values based on the data format and create a plurality of virtual processing units based on the plurality of focus values. Each of the plurality of virtual processing units may process a sub-group of the plurality of records that corresponds to the focus value associated with the respective virtual processing unit.
    Type: Grant
    Filed: February 26, 2018
    Date of Patent: January 29, 2019
    Assignee: CAPITAL ONE SERVICES, LLC
    Inventor: Japan Bhatt
  • Patent number: 10176036
    Abstract: A lightweight always-on monitoring, collecting, diagnosing, and correcting utility operates in an enhanced storage manager that manages a data storage managements system. The always-on utility provides a comprehensive and pro-active approach, which is intended to reduce, if not altogether eliminate, the need for after-the-fact diagnostics. The always-on utility also enforces so-called best practices and other heuristics, which include pro-actively activating certain database settings that are not enabled by default; manipulating certain aspects of the database to improve performance; and reporting aspects that are outside best-practice parameters to the trouble report system so that system administrators and/or developers may intervene before a catastrophic failure occurs. In some cases, the best-practice parameters represent heuristics designed by the present inventors to improve the performance and general health of the management database.
    Type: Grant
    Filed: October 25, 2016
    Date of Patent: January 8, 2019
    Assignee: Commvault Systems, Inc.
    Inventors: Ganesh Haridas, Sundar Narasimman, Karthik Suriyanarayanan, Gunassekaran A S, Michael Frank Klose
  • Patent number: 10146579
    Abstract: A technique for enabling real-time CPU-bound in-kernel workloads to run infinite loops while keeping read-copy update (RCU) grace periods finite. In an embodiment, a per-CPU indicator may be set to indicate that a CPU running the CPU-bound in-kernel workload has not reported an RCU quiescent state within a defined time. A function may be invoked from within the workload that causes an RCU quiescent state to be reported on behalf of the CPU if the per-CPU indicator is set. If the RCU quiescent state is not reported within a longer defined time, the CPU may be rescheduled.
    Type: Grant
    Filed: February 6, 2017
    Date of Patent: December 4, 2018
    Assignee: International Business Machines Corporation
    Inventor: Paul E. McKenney
  • Patent number: 10146577
    Abstract: A technique for enabling real-time CPU-bound in-kernel workloads to run infinite loops while keeping read-copy update (RCU) grace periods finite. In an embodiment, a per-CPU indicator may be set to indicate that a CPU running the CPU-bound in-kernel workload has not reported an RCU quiescent state within a defined time. A function may be invoked from within the workload that causes an RCU quiescent state to be reported on behalf of the CPU if the per-CPU indicator is set. If the RCU quiescent state is not reported within a longer defined time, the CPU may be rescheduled.
    Type: Grant
    Filed: December 11, 2016
    Date of Patent: December 4, 2018
    Assignee: International Business Machines Corporation
    Inventor: Paul E. McKenney
  • Patent number: 10142406
    Abstract: Systems and methods are presented for automatically selecting a data center that can communicate with a user computing system over a connection that provides reduced or minimal latency. In some cases, the system can select the data center based on the calculation of one or more latency factors that correlate, at least in part, to the latency of a communication channel between the data center and the user computing system. Further, the selected data center may be identified from a set of data centers that include one or more computing resources the user has identified as desiring to access.
    Type: Grant
    Filed: March 11, 2013
    Date of Patent: November 27, 2018
    Assignee: Amazon Technologies, Inc.
    Inventors: Deepak Suryanarayanan, David Everard Brown, Malcolm Russell Ah Kun, Eugene Michael Farrell
  • Patent number: 10095745
    Abstract: A continuous query parallel engine on data streams provides scalability and increases the throughput by the addition of new nodes. The parallel processing can be applied to data stream processing and complex events processing. The continuous query parallel engine receives the query to be deployed and splits the original query into subqueries, obtaining at least one subquery; each subquery is executed in at least in one node. Tuples produced by each operator of each subquery are labeled with timestamps. A load balancer is interposed at the output of each node that executes each one of the instances of the source subquery and an input merger is interposed in each node that executes each one of the instances of a destination subquery. After checks are performed, further load balancers or input managers may be added.
    Type: Grant
    Filed: June 17, 2011
    Date of Patent: October 9, 2018
    Assignee: UNIVERSIDAD POLITECNICA DE MADRID
    Inventors: Ricardo Jiménez Peris, Marta Patiño Martínez
  • Patent number: 10089307
    Abstract: Described is a framework that manages a clustered, distributed NoSQL data store across multiple server nodes. The framework may include daemons running on every server node, providing auto-sharding and unified data service such that user data can be stored and retrieved consistently from any node. The framework may further provide capabilities such as automatic fail-over and dynamic capacity scaling.
    Type: Grant
    Filed: December 30, 2015
    Date of Patent: October 2, 2018
    Assignee: International Business Machines Corporation
    Inventors: Keyan Kousha, Michelle C. Munson, Serban Simu, Ying Xu
  • Patent number: 10067974
    Abstract: Techniques are herein described for loading a portion of a database object into volatile memory without blocking database manipulation language transactions. The techniques involve invalidating data items loaded from blocks affected by a transaction, referred to as a straddling transaction that started before the load time and committed after the load time. Identifying these straddling transactions involves reviewing one or more transaction lists associated with the set of data items loaded in memory. The transaction list may be read in reverse temporal order of commit to identify a transaction meeting the criteria of starting before the load start, not committing before the load time, and affecting a data item loaded in memory.
    Type: Grant
    Filed: December 29, 2015
    Date of Patent: September 4, 2018
    Assignee: Oracle International Corporation
    Inventors: Vivekanandhan Raja, Atrayee Mullick, Sanket Hase, Sukhada Pendse, Amit Ganesh, Vineet Marwah, Neil MacNaughton
  • Patent number: 10007581
    Abstract: A technique referred to as “data structure chronicles” is described that may be used to build strictly failure resilient persistent concurrent data structures. A “chronicle” maintains a persistent history of operations invoked on a persistent data structure that can be replayed to recover the current consistent state of the data structure after a failure. The chronicle technique may also enable composability of data structure operations with the enclosing application. In addition, the chronicle technique is non-blocking, a desirable progress condition for concurrent data structures. A lock free, non-blocking chronicle stack algorithm is described that may outperform a lock-based implementation in the presence of high contention. In addition, a lock free, non-blocking chronicle queue algorithm is described.
    Type: Grant
    Filed: January 5, 2016
    Date of Patent: June 26, 2018
    Assignee: Oracle International Corporation
    Inventors: Virendra J. Marathe, Joseph H. Izraelevitz
  • Patent number: 9996264
    Abstract: Techniques and mechanisms are provided for migrating data blocks around a cluster during node addition and node deletion. Migration requires no downtime, as a newly added node is immediately operational while the data blocks are being moved. Blockmap files and deduplication dictionaries need not be updated.
    Type: Grant
    Filed: July 26, 2016
    Date of Patent: June 12, 2018
    Assignee: Quest Software Inc.
    Inventors: Vinod Jayaraman, Abhijit Dinkar, Mark Taylor, Goutham Rao, Michael E. Root, Murali Bashyam
  • Patent number: 9990383
    Abstract: The present disclosure involves a method of ingesting data in an enterprise server environment. A configuration file is accessed. The configuration file specifies a blueprint for constructing a data adaptor that includes a data adaptor source, a data adaptor sink, and a data adaptor channel coupled between the data adaptor source and the data adaptor sink. The data adaptor is constructed based on the configuration file. Via the data adaptor, data is retrieved from a first entity. Also via the data adaptor, the retrieved data is written to a second entity different from the first entity. The accessing, the constructing, the retrieving, and the writing are performed by one or more electronic processors.
    Type: Grant
    Filed: July 29, 2015
    Date of Patent: June 5, 2018
    Assignee: EBAY INC.
    Inventor: John Peter Brinnand
  • Patent number: 9979734
    Abstract: Briefly, embodiments disclosed herein relate to managing transactions in a distributed content transaction system.
    Type: Grant
    Filed: April 20, 2015
    Date of Patent: May 22, 2018
    Assignee: Oath Inc.
    Inventors: Edward Bortnikov, Ohad Shacham, Idit Keidar, Eshcar Hillel, Sameer Paranjpye
  • Patent number: 9959332
    Abstract: In one embodiment, a method includes determining a number of initial servers in a massively parallel processing (MPP) database cluster and determining an initial bucket configuration of the MPP database cluster, where the initial bucket configuration has a number of initial buckets. The method also includes adding a number of additional servers to the MPP database cluster to produce a number of updated servers, where the updated servers include the initial servers and the additional servers and creating an updated bucket configuration in accordance with the number of initial servers, the initial bucket configuration, and the number of additional servers, where the updated bucket configuration has a number of updated buckets. Additionally, the method includes redistributing data of the MPP cluster in accordance with the updated bucket configuration.
    Type: Grant
    Filed: January 21, 2015
    Date of Patent: May 1, 2018
    Assignee: Futurewei Technologies, Inc.
    Inventors: Le Cai, Qingqing Zhou, Kamini Jagtiani
  • Patent number: 9922097
    Abstract: A system that enables a user to configure alert actions based on search results generated by a query is disclosed. During operation, the system presents an alert user interface (UI) to a user, wherein the alert UI enables the user to configure one or more alert actions to be performed based on the search results. Next, the system receives alert configuration information from the user through the alert UI, wherein the alert configuration information includes tokens representing parameters associated with the query and the search results. Then, while generating an alert associated with the search results, the system performs a token substitution operation that substitutes tokens in the alert configuration information with corresponding parameters from the search results to generate a payload that is communicated to alert-generating functionality. This token substitution allows the parameters to be used by the alert-generating functionality while performing the one or more alert actions.
    Type: Grant
    Filed: April 28, 2015
    Date of Patent: March 20, 2018
    Assignee: Splunk Inc.
    Inventors: Nicholas J. Filippi, Siegfried Puchbauer-Schnabel, Carl S. Yestrau, Vivian Shen, J. Mathew Elting
  • Patent number: 9916360
    Abstract: An approach for joining operations on document-oriented databases. The approach consists of receiving database identifiers, common attributes and results attributes for core and target databases being joined. Common attributes are searched for in the databases. The searches performed include string, expansive, character and nested. Common attribute join conflicts are identified and input is received to resolve attribute join conflicts. Resolved join conflicts are updated in a join substitution database for subsequent use and joined data results are output to virtual table(s).
    Type: Grant
    Filed: December 13, 2016
    Date of Patent: March 13, 2018
    Assignee: International Business Machines Corporation
    Inventors: Phani Kumar V U Ayyagari, Manish A. Bhide, Bhavani K. Eshwar, Purnachandra R. Jasti
  • Patent number: 9881080
    Abstract: An electronic document analysis method receiving N electronic documents pertaining to a case encompassing a set of issues including at least one issue and establishing relevance of at least the N documents to at least one individual issue in the set of issues, the method comprising, for at least one individual issue from among the set of issues, receiving an output of a categorization process applied to each document in training and control subsets of the at least N documents, the output including, for each document in the subsets, one of a relevant-to-the-individual issue indication and a non-relevant-to-the-individual issue indication; building a text classifier simulating the categorization process using the output for all documents in the training subset of documents; and running the text classifier on the at least N documents thereby to obtain a ranking of the extent of relevance of each of the at least N documents to the individual issue.
    Type: Grant
    Filed: July 15, 2016
    Date of Patent: January 30, 2018
    Assignee: MICROSOFT ISRAEL RESEARCH AND DEVELOPMENT (2002) LTD
    Inventor: Yiftach Ravid
  • Patent number: 9870378
    Abstract: A computer-implemented method for improving database management includes selecting one or more database records that are requested based on a query statement. The one or more database records are read from a first database file. The one or more database records are copied from the first database file and stored to a memory. The one or more database records are deleted from the first database file at substantially the same time as the reading the one or more database records. The reading and the deleting occur through a single read and delete input/output (I/O) operation.
    Type: Grant
    Filed: November 18, 2014
    Date of Patent: January 16, 2018
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Patent number: 9852225
    Abstract: Features that may be used to represent relevance information (e.g., properties, characteristics, etc.) of an entity, such as a document or concept for example, may be associated with the document by accepting an identifier that identifies a document; obtaining search query information (and/or other serving parameter information) related to the document using the document identifier, determining features using the obtained query information (and/or other serving parameter information), and associating the features determined with the document. Weights of such features may be similarly determined. The weights may be determined using scores. The scores may be a function of one or more of whether the document was selected, a user dwell time on a selected document, whether or not a conversion occurred with respect to the document, etc. The document may be a Web page. The features may be n-grams. The relevance information of the document may be used to target the serving of advertisements with the document.
    Type: Grant
    Filed: April 23, 2015
    Date of Patent: December 26, 2017
    Assignee: Google Inc.
    Inventors: Ross Koningstein, Stephen Lawrence, Valentin Spitkovsky
  • Patent number: 9852207
    Abstract: A method for transporting relational data from one relational database to another such database. The data transported may be a subset of data in the entire database and the relations between the root of this data and other data entities are preserved in a way allowing their reconstruction in the target database. This preservation, itself further directed through configuration, is able to recreate new data identifiers without collision, yet also without requiring maintenance of the original identifiers.
    Type: Grant
    Filed: August 25, 2016
    Date of Patent: December 26, 2017
    Assignee: IFWIZARD CORPORATION
    Inventor: Dominic Samuel Sellers-Blais
  • Patent number: 9824134
    Abstract: A plurality of transactions is handled in a database. Each transaction includes a plurality of operations on at least one record in the database with at least two of the transactions being handled concurrently. Thereafter, a temporary timestamp is assigned to each record. The temporary timestamp are based, at least in part, on the corresponding transaction. Further, a final timestamp is assigned to each record with a commit operation. It can later be determined, using a visibility function and based on the assigned temporary timestamps and final timestamps, which of the records are visible in a consistent view for a first transaction. Based on such determination, access can be provided to those records determined to be visible to be accessed to the first transaction.
    Type: Grant
    Filed: November 25, 2014
    Date of Patent: November 21, 2017
    Assignee: SAP SE
    Inventors: Ivan Schreter, Juchang Lee, Mihnea Andrei, Changgyoo Park
  • Patent number: 9779127
    Abstract: Example systems and methods for integrating a primary data store (e.g., a source-of-truth relational database management system) and a secondary data store (e.g., external cache) are described. The approach implements a modified read-through/write-through data access pattern that integrates read and write flows in order to support high-concurrency environments while maintaining immediate consistency between stores. Writes are handled using a three-phase flow that avoids concurrency-related race conditions and the need to block in the secondary store in order to maintain cross-store consistency. Reads are never dirty and will repair the secondary store as needed without conflicting with repairs that may have been initiated by other sessions.
    Type: Grant
    Filed: March 31, 2014
    Date of Patent: October 3, 2017
    Assignee: WAL-MART STORES, INC.
    Inventors: Jason Sardina, Alexei Olkhovskii, Robert P. Lowell, Michael Machado
  • Patent number: 9769150
    Abstract: An example method for migrating communication data from a source server to a target server includes obtaining, using a computing device, a set of credentials to access the source server, and accessing the source server using the set of credentials. The method also includes requesting, automatically by the computing device, a directory structure associated with communication data from the source server, populating, by the computing device, the target server using the directory structure, requesting the communication data from the source server, and populating the target server with the communication data.
    Type: Grant
    Filed: January 14, 2011
    Date of Patent: September 19, 2017
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Kutlay Topatan, Maxim Ivanov, Victor Boctor, Palash Biswas, Bernard Luke Gallagher
  • Patent number: 9754008
    Abstract: A method for scaling out database information may include creating second database instantiation. The method may include configuring one or more partitions of a first database for transfer to the second database and configuring the second database for receiving the one or more first database partitions. The method may also include transferring the one or more first database partitions to the second database.
    Type: Grant
    Filed: November 2, 2015
    Date of Patent: September 5, 2017
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Goksel Genc, Humberto Lezama Guadarrama, Gary Chang, Andrew Sean Watson
  • Patent number: 9753977
    Abstract: A database management method generates an execution plan with respect to a factorized character string generated by factoring an execution value list of a query and storing the factorized character string and an execution plan identifier associated with the factorized character string. The method includes receiving a factorized character string generated from a query; determining whether the factorized character string is stored in a memory; transmitting an execution plan identifier matching the factorized character string stored in the memory when the factorized character string is stored in the memory; generating and transmitting an execution plan identifier with respect to an execution plan of the factorized character string when the factorized character string is not stored in the memory; receiving a query request consisting of the execution plan identifier and an execution value list included in the query; and providing a query result obtained using the query request.
    Type: Grant
    Filed: January 23, 2014
    Date of Patent: September 5, 2017
    Assignee: Naver Corporation
    Inventors: Kyung Sik Seo, Ki Eun Park
  • Patent number: 9747293
    Abstract: A method, a system, and a computer program product for storing and retrieving information are provided. The system receives information. Thereafter, the system organizes the information for optimal storage and retrieval based on qualities of a storage medium. The organizing may include optimizing the information for sequential read and/or write access. The information may be organized in an append-only manner. Once the information has been organized, the apparatus presents and/or stores the organized information.
    Type: Grant
    Filed: February 28, 2013
    Date of Patent: August 29, 2017
    Assignee: DEEP INFORMATION SCIENCES, INC.
    Inventors: Thomas Hazel, Jason P. Jeffords, Gerard L. Buteau
  • Patent number: 9740755
    Abstract: An event limited field picker for a search user interface is described. In one or more implementations, a service may operate to collect and store data as events each of which includes a portion of the data correlated with a point in time. Clients may use a search user interface perform searches by input of search criteria. Responsive to receiving search criteria, the service may operate to apply a late binding schema to extract events that match the search criteria and provide search results for display via the search user interface. The search user interface exposes an event limited field picker operable to make selections of fields with respect to individual events in a view of the search results. In response to receiving an indication of a fields selected via the picker, visibility of selected fields may be updated to control which field and values are included in different views.
    Type: Grant
    Filed: January 29, 2016
    Date of Patent: August 22, 2017
    Assignee: SPLUNK, INC.
    Inventors: Divanny I. Lamas, Marc Vincent Robichaud, Carl Sterling Yestrau
  • Patent number: 9733834
    Abstract: A system comprises a plurality of computing devices that are communicatively coupled via a network and have a file system distributed among them, and comprises one or more file system request buffers residing on one or more of the plurality of computing devices. File system choking management circuitry that resides on one or more of the plurality of computing devices is operable to separately control: a first rate at which a first type of file system requests (e.g., one of data requests, data read requests, data write requests, metadata requests, metadata read requests, and metadata write requests) are fetched from the one or more buffers, and a second rate at which a second type of file system requests (e.g., another of data requests, data read requests, data write requests, metadata requests, metadata read requests, and metadata write requests) are fetched from the one or more buffers.
    Type: Grant
    Filed: February 11, 2016
    Date of Patent: August 15, 2017
    Assignee: Weka.iO Ltd.
    Inventors: Maor Ben Dayan, Omri Palmon, Liran Zvibel, Kanael Arditti, Tomer Filiba
  • Patent number: 9734183
    Abstract: A method of data-oriented approach for performing view updates in database systems includes: processing one or more source databases of views to generate at least one summarization of the one or more source databases; utilizing the at least one summarization of the one or more source databases to determine one or more side effects associated with the view updates; and where upon the view updates have one or more side effects, preventing the view updates from being performed.
    Type: Grant
    Filed: August 5, 2014
    Date of Patent: August 15, 2017
    Assignee: Hong Kong Baptist University
    Inventors: Koon Kau Choi, Yun Peng
  • Patent number: 9715438
    Abstract: Provided are techniques for static execution of statements. Information from an execution file that describes statements that have been bound to a database during a previous execution of those statements dynamically and describes metadata about the statements is loaded. While executing a program that includes statements, for each of the statements, it is determined whether that statement is bound to the database. In response to determining that the statement is bound to the database, the statement is executed statically using the loaded information. In response to determining that the statement is not bound to the database, the statement is executed dynamically.
    Type: Grant
    Filed: June 29, 2007
    Date of Patent: July 25, 2017
    Assignee: International Business Machines Corporation
    Inventors: William Robert Bireley, Stephen Andrew Brodsky, Jaijeet Chakravorty, Anshul Dawra, Swaminathan Gounder
  • Patent number: 9678983
    Abstract: Aspects of the present disclosure involve systems and methods for passing optimization information, which may be used to optimize input/output (“I/O”) requests, from a database management system to a file system, using various protocols of a network file system. The optimization information provided by the database management system may relate to various aspects of an I/O request that may be optimized.
    Type: Grant
    Filed: October 19, 2012
    Date of Patent: June 13, 2017
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventors: Brian Lee Wong, Chunli Zhang, Gerald Thornbrugh, Siddheshwar Mahesh
  • Patent number: 9672220
    Abstract: In one embodiment, a method includes determining a data node corresponding to a data record to be inserted/updated in an index structure of a record-oriented file system, creating a lock on a corresponding data node, splitting the corresponding data node sequentially into two data nodes and storing the data record in one of the two data nodes in response to the corresponding data node not having free space sufficient to store/update the data record, storing a high key of the first of the two data nodes to a parent index node, splitting the parent index node sequentially into two index nodes in response to the parent index node not having free space sufficient to store/update the high key of the first of the two data nodes, and storing the high key of the first of the two data nodes in one of the two index nodes.
    Type: Grant
    Filed: May 9, 2016
    Date of Patent: June 6, 2017
    Assignee: International Business Machines Corporation
    Inventors: Debra J. Benjamin-Deckert, Lawrence L. T. Law, Terri A. Menendez
  • Patent number: 9672077
    Abstract: Access to a shareable resource between threads is controlled by a lock having shared, optimistic and exclusive modes and maintaining a list of threads requesting ownership of said lock. A shared optimistic mode is provided. A lock state descriptor is provided for each desired change of mode comprising a current mode in which a thread has already acquired the lock. When a thread acquires the lock in shared optimistic mode, other threads are allowed to acquire the lock in shared or optimistic mode. When a thread which acquired the lock in shared optimistic mode wants to acquire the lock in exclusive mode, other threads which have acquired the lock in shared or optimistic mode are prevented from acquiring the lock in exclusive mode until the thread which acquired the lock in shared optimistic mode and requested to acquire the lock in exclusive mode releases the lock.
    Type: Grant
    Filed: May 5, 2016
    Date of Patent: June 6, 2017
    Assignee: International Business Machines Corporation
    Inventor: Marco Greco
  • Patent number: 9665394
    Abstract: The present invention discloses a method and system for sharing application objects among multiple tenants, wherein the method comprises: identifying objects that can be shared by multiple tenants; merging the objects that can be shared by the multiple tenants; and updating references of the tenants to the shared objects prior to the merging so as to cause the references to point at a merged shared object. The method of the present invention enables the tenants to share application data more efficiently.
    Type: Grant
    Filed: March 21, 2014
    Date of Patent: May 30, 2017
    Assignee: International Business Machines Corporation
    Inventors: Snehal S. Antani, Junjie Cai, Jia Fei, Wei Wei Gao, Heng Wang, Yan R. Wu
  • Patent number: 9646044
    Abstract: Technology for applying locks to memory pages. More specifically, a sticky lock is chosen by matching observed usage patterns with predetermined patterns associated with various sticky locks and/or types of stick locks increase database performance by reducing required communications and information transfers.
    Type: Grant
    Filed: November 26, 2014
    Date of Patent: May 9, 2017
    Assignee: International Business Machines Corporation
    Inventors: Ronen Grosman, Matthew A. Huras, Bret R. Olszewski, Keriley K. Romanufa, Aamer U. Sachedina, Xun Xue
  • Patent number: 9639544
    Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for a distributed parallel processing database system that persists table data in memory to a distributed file system. A distributed parallel processing database system persists table data in memory to a distributed file system. A parameter of creating a database table specifies that data records in the database table and history of changes to the data records can be stored in memory as well as in the distributed file system. When the database table is populated or otherwise modified, data records and the history in memory are evicted to the distributed file system as log files and removed from memory. The log files can be designated as write-only, where the data records, once written, cannot be read by structured query language (SQL) queries, or as read-write, where the data records, once written, can be read by SQL queries.
    Type: Grant
    Filed: October 28, 2014
    Date of Patent: May 2, 2017
    Assignee: Pivotal Software, Inc.
    Inventors: Daniel Allen Smith, Anthony M. Baker, Sumedh Wale, Hemant Bhanawat, Jagannathan Ramnarayanan, Swapnil Prakash Bawaskar, Ashvin Agrawal, Neeraj Kumar
  • Patent number: 9632843
    Abstract: A method and system for allocating memory in a RAID system. A RAID system requires the use of shared memory to store processed data related to operations of different mass storage devices. Certain RAID algorithms require different sizes of memory regions of the memory, and multiple requests to lock the required memory regions are therefore required. As multiple requests are made in parallel for different operations, the multiple requests for each operation are sorted in a predetermined order. This ensures that all memory regions for one operation can be locked. Requests for memory regions locked by a second operation are held in a pending state to wait for release of those memory regions by a first operation, at which point they are locked again by the second operation.
    Type: Grant
    Filed: April 20, 2015
    Date of Patent: April 25, 2017
    Assignee: Microsemi Storage Solutions (U.S.), Inc.
    Inventors: Jesslly Wong, Raymond Lam, Tao Zhong
  • Patent number: 9633035
    Abstract: A method and system for storage of a data block for time continuum back-in-time data retrieval. The method comprises receiving a data block from a user node; updating an index stored in a memory respective of a time that the data block was received, wherein the time is a past time for retrieval of the data block; generating a hash number respective of contents of the data block; updating the index with the generated hash number; checking for existence of the generated hash number in a database; upon determination that the generated hash number does not exist in the database saving the data block in a storage device; increasing monotonously a transaction number respective of the generated hash number; and updating the index with the transaction number.
    Type: Grant
    Filed: January 13, 2014
    Date of Patent: April 25, 2017
    Assignee: Reduxio Systems Ltd.
    Inventors: Nir Peleg, Amnon Arthur Strasser, Or Sagi
  • Patent number: 9633070
    Abstract: According to embodiments of the present invention, one or more computer processors determine that a predetermined workload threshold associated with an invalidated object is not exceeded and transmits an invalidation command associated with the invalidated object to the owner of the invalidated object. The one or more computer processors instruct the modifier of the invalidated object to retain possession of a first lock on the object beyond the transaction. The one or more computer processors determine that a usage pattern associated with the invalidated object matches a predetermined usage pattern for selecting a lock that can be retained beyond an associated transaction and transmits a second lock a requestor. The one or more computer processors instruct the modifier to release possession of the first lock to the owner and transmit a first image of the current version of the invalidated object to the owner for subsequent transmission to the requestor.
    Type: Grant
    Filed: March 31, 2014
    Date of Patent: April 25, 2017
    Assignee: International Business Machines Corporation
    Inventors: Ronen Grosman, Matthew A. Huras, Bret R. Olszewski, Keriley K. Romanufa, Aamer U. Sachedina, Xun Xue