Computer data is increasingly vital to modern organizations, and protecting against data loss in the event of a system failure is an increasingly important organization objective. Data protection systems for storing organizational source (e.g., production) site data on a periodic basis suffer from several drawbacks. First, they require a system shutdown during backup, since the data being backed up cannot be used during the backup operation. Second, they limit the points in time to which the production site can recover. For example, if data is backed up on a daily basis, there may be several hours of lost data in the event of a disaster. Third, the data recovery process itself is both time consuming and can consume system resources.
Some data protection systems use data replication, by creating a copy of the organization's production site data on a secondary backup storage system, and updating the backup with changes. The backup storage system may be situated in the same physical location as the production storage system, or in a physically remote location. Data replication systems generally operate either at the application level, at the file system level, at the hypervisor level or at the data block level.
This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
One aspect may provide a process for performing data migration in a storage system. One or more consistency groups may be migrated from at least one source device to at least one target device in the storage system. The consistency groups may be replicated from the source device to the target device by an asynchronous data replication operation from the source device to the target device and one or more synchronous data replication operations from the source device to the target device if data stored on the source device is changed. The consistency groups may be operated on the source device and the target device in an active-active mode, wherein the source device and target device may be active and accessible by host devices. Replicated consistency groups may be determined to include in a cutover operation that is performed by deactivating the at least one source device associated with the included consistency groups.
Another aspect may provide a system including a processor and memory that stores computer program code that when executed on the processor causes the processor to execute a data migration operation to migrate data from at least one source volume to at least one target volume in a storage system. One or more consistency groups may be replicated from the source device to the target device by performing an asynchronous data replication operation from the source device to the target device and performing one or more synchronous data replication operations from the source device to the target device if data stored on the source device is changed. The consistency groups may be operated on the source device and the target device in an active-active mode. In the active-active mode, the source device may be active and accessible by one or more host devices, and the target device may also be active and accessible by one or more host devices. One or more replicated consistency groups are selected to include in a cutover operation. The cutover operation may be performed by deactivating the source device associated with the included consistency groups.
Another aspect may provide a computer program product including a non-transitory computer readable storage medium having computer program code encoded thereon that when executed on a processor of a computer causes the computer to execute a data migration operation to migrate data from at least one source volume to at least one target volume in a storage system. One or more consistency groups may be replicated from the source device to the target device by performing an asynchronous data replication operation from the source device to the target device and performing one or more synchronous data replication operations from the source device to the target device if data stored on the source device is changed. The consistency groups may be operated on the source device and the target device in an active-active mode. In the active-active mode, the source device may be active and accessible by one or more host devices, and the target device may also be active and accessible by one or more host devices. One or more replicated consistency groups may be selected to include in a cutover operation. The cutover operation may be performed by deactivating the source device associated with the included consistency groups.
Objects, aspects, features, and advantages of embodiments disclosed herein will become more fully apparent from the following detailed description, the appended claims, and the accompanying drawings in which like reference numerals identify similar or identical elements. Reference numerals that are introduced in the specification in association with a drawing figure may be repeated in one or more subsequent figures without additional description in the specification in order to provide context for other features. For clarity, not every element may be labeled in every figure. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating embodiments, principles, and concepts. The drawings are not meant to limit the scope of the claims included herewith.
Storage system 100 may include at least one source site 102 and at least one target site 112, which may be co-located or geographically separated. Source site 102 may include one or more processors 105, storage application 106, and storage 108. In some embodiments, storage 108 may include one or more storage volumes 1351-S, that operate as active or production volumes. Target site 112 may include replica manager 116 that manages a plurality of replicas 1181-N (generally referred to herein as replicas 118) according to a policy 114 (e.g., a replication and/or retention policy). Replicas 118 may be stored in one or more volumes 1391-Z of storage 137 of target site 112. Target site 112 may also include one or more processors 133. Source site 102 and target site 112 may be in communication with one or more hosts 113 via communication links 111 and 115, respectively.
Hosts 113 may perform input/output (I/O) operations on source-side storage 108 (e.g., read data from and write data to storage 108). In some embodiments, the I/O operations may be intercepted by and controlled by storage application 106. As changes are made to data stored on storage 108 via the I/O operations from hosts 113, or over time as storage system 100 operates, storage application 106 may perform data migration 121 from source site 102 to target site 112 over communication link 110. In some embodiments, communication link 110 may be a long distance communication link of a storage area network (SAN), such as an Ethernet or Internet (e.g., TCP/IP) link that may employ, for example, the iSCSI protocol. In some embodiments, one or both of source site 102 and/or target site 112 may include internal (e.g., short distance) communication links (shown as communication links 109 and 119) to transfer data between storage volumes 1391-Z of storage 137 for storing replicas 1181-N, such as an InfiniBand (IB) link or Fibre Channel (FC) link.
In illustrative embodiments, storage system 100 may employ a snapshot (or replication) mechanism to replicate data between source site 102 and target site 112. A replica (or snapshot) may be created from data within storage 108 and transferred to one or more target sites 112 during a data replication cycle that may be performed based on data replication policies (e.g., policy 114) that may define various settings for data recovery operations. A data replication cycle may be asynchronous data replication performed at time-based intervals during operation of storage system 100, or may alternatively be synchronous data replication performed when data is changed on source site 102.
Storage system 100 may include one or more consistency groups. A consistency group 147 may include one or more volumes 135 of source site 102, each associated with a corresponding volume 139 of target site 112. Consistency group 147 may treat source volumes 135 and target volumes 139 as a single logical entity for data replication and migration. Each volume 139 may store one or more associated replicas 118 that reflect the data in the consistency group 147 at a point in time (e.g., when the replica 118 was created). For example, replicas (e.g., snapshots) 118 may be generated for each source volume 135 of consistency group 147 at the same time, and stored on associated ones of target volumes 139. As shown in
Illustrative embodiments may migrate data from one or more volumes 1351-S of source site 102 to one or more volumes 1391-Z of storage 137 of target site 112 in a “seamless” manner, shown as data migration 121. For example, data migration operation 121 may be said to be seamless if data is migrated from a first set of volumes of source site 102 (e.g., a first set of volumes 1351-S) to a second set of volumes 1391-Z of storage 137 of target site 112 while the storage system is operating and without the migrated data being unavailable to storage system 100 for other input/output (I/O) operations such as reads or writes. In other words, relocation of the data from source site 102 to target site 112 is “invisible” to users of the storage system in that the storage system is operable throughout data migration operation 121. In some embodiments, the migrated data may include snapshots (or replicas) created for data recovery.
Once the data is moved from source site 102 to target site 112 (including SCSI “personalities” of the source volumes), hosts 113 may connect to volumes 1391-Z of target site 112, and the volumes 1351-S of source site 102 can be deactivated (e.g., cutover). In some embodiments, a SCSI personality of a given volume may include meta-data associated with the volume. The meta-data may include, for example, one or more properties of the given volume (e.g., size, block size, transfer size, one or more features supported by the volume, etc.), one or more identifiers associated with the given volume (e.g., a volume serial number, a volume address, or vendor information of the volume) and dynamic state information of the volume (e.g., SCSI reservation state information of the volume, Asymmetric Logical Unit Access (ALUA) state information of the volume, etc.). In some embodiments, the SCSI personality meta-data may be stored in one or more inquiry pages of the volume, such as Vital Product Data (VPD) information pages of the volume. During data migration operation 121, the SCSI personalities of given ones of target volumes 1391-Z may be matched to the SCSI personalities of associated ones of source volumes 1351-S.
In some embodiments, during data migration operation 121, storage system 100 may operate in an active/passive mode, where hosts 113 cutover from source site 102 to target site 112, such that only one of the source site 102 and the target site 112 is accessible by hosts 113. In some embodiments, during data migration operation 121, storage system 100 may operate in an active/active mode, where hosts 113 are allowed concurrent access to both source site 102 and target site 112. In the active/active mode, source site 102 (or one or more volumes 135 of source site 102) may later be disconnected and removed, and hosts 113 access only target site 112.
Referring to
Referring to
Although not shown in
At block 310, storage system 100 may receive a selection of one or more consistency groups to include in a cutover operation and, at block 312, the cutover operation may be performed for the consistency groups selected at block 310. For example, a cutover operation from a source device to a target device may allow host access only to the target device and allow the source device to be deactivated. As indicated by block 314, block 312 may be iteratively repeated until the selected consistency groups have had the cutover operation performed. At block 314, once the selected consistency groups have had the cutover operation performed, at block 316 storage system 100 may determine whether the consistency groups have been successfully migrated. If, at block 316, one or more of the consistency groups have not been successfully migrated, then at block 318, storage system 100 may receive a request to re-attempt data migration for one or more volumes or consistency groups, and process 300 may repeat at block 306. Alternatively, at block 318, storage system 100 may receive a request to cancel data migration for one or more consistency groups (e.g., to determine a cause of the data migration failure, etc.). If, at block 316, the consistency groups have been successfully migrated, then at block 320, data migration process 300 completes.
Referring to
Described embodiments may provide an automated process to perform application-by-application data migration processes individually and in parallel, allowing sharing of resources of storage system 100 and maximizing utilization of link 110. As described, some embodiments may start a data migration by performing an asynchronous date replication from source site 102 to target site 112. Synchronous data replication may be performed as necessary (e.g., as data is modified on source site 102). Source site 102 and target site 112 may be operated in an active-active mode where both source site 102 and target site 112 may be accessible to hosts 113, and data is updated to both source site 102 and target site 112 as data operations occur. A cutover operation from source site 102 to target site 112 may be performed after receiving confirmation (e.g., a selection of one or more consistency groups) to perform the cutover operation.
Described embodiments of storage system 100 may pause a data migration operation before performing a cutover operation (e.g., storage system 100 is operated with both source site 102 and target site 112 active). For example, a data migration process may be started for a large number (e.g., hundreds) of applications (or consistency groups) in parallel. As they are migrated, the applications (or consistency groups) may operate in the active-active mode on both source site 102 and target site 112 until receiving a selection of one or more of the applications (or consistency groups) to cutover to operate only on target site 112. The applications (or consistency groups) may then be cutover one-by-one. In other embodiments, storage system 100 may operate in asynchronous replication mode until receiving a selection of one or more of the applications (or consistency groups) to continue the migration process (e.g., to continue process 306′ from block 404 to block 406).
Referring to
Processes 300 and 306′ (
The processes described herein are not limited to the specific embodiments described. For example, processes 300 and 306′ are not limited to the specific processing order shown in
Processor 502 may be implemented by one or more programmable processors executing one or more computer programs to perform the functions of the system. As used herein, the term “processor” is used to describe an electronic circuit that performs a function, an operation, or a sequence of operations. The function, operation, or sequence of operations can be hard coded into the electronic circuit or soft coded by way of instructions held in a memory device. A “processor” can perform the function, operation, or sequence of operations using digital values or using analog signals. In some embodiments, the “processor” can be embodied in an application specific integrated circuit (ASIC). In some embodiments, the “processor” can be embodied in a microprocessor with associated program memory. In some embodiments, the “processor” can be embodied in a discrete electronic circuit. The “processor” can be analog, digital or mixed-signal.
While illustrative embodiments have been described with respect to processes of circuits, described embodiments may be implemented as a single integrated circuit, a multi-chip module, a single card, or a multi-card circuit pack. Further, as would be apparent to one skilled in the art, various functions of circuit elements may also be implemented as processing blocks in a software program. Such software may be employed in, for example, a digital signal processor, micro-controller, or general purpose computer. Thus, described embodiments may be implemented in hardware, a combination of hardware and software, software, or software in execution by one or more processors.
Some embodiments may be implemented in the form of methods and apparatuses for practicing those methods. Described embodiments may also be implemented in the form of program code, for example, stored in a storage medium, loaded into and/or executed by a machine, or transmitted over some transmission medium or carrier, such as over electrical wiring or cabling, through fiber optics, or via electromagnetic radiation. A non-transitory machine-readable medium may include but is not limited to tangible media, such as magnetic recording media including hard drives, floppy diskettes, and magnetic tape media, optical recording media including compact discs (CDs) and digital versatile discs (DVDs), solid state memory such as flash memory, hybrid magnetic and solid state memory, non-volatile memory, volatile memory, and so forth, but does not include a transitory signal per se. When embodied in a non-transitory machine-readable medium, and the program code is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the method.
When implemented on a processing device, the program code segments combine with the processor to provide a unique device that operates analogously to specific logic circuits. Such processing devices may include, for example, a general purpose microprocessor, a digital signal processor (DSP), a reduced instruction set computer (RISC), a complex instruction set computer (CISC), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a programmable logic array (PLA), a microcontroller, an embedded controller, a multi-core processor, and/or others, including combinations of the above. Described embodiments may also be implemented in the form of a bitstream or other sequence of signal values electrically or optically transmitted through a medium, stored magnetic-field variations in a magnetic recording medium, etc., generated using a method and/or an apparatus as recited in the claims.
Various elements, which are described in the context of a single embodiment, may also be provided separately or in any suitable subcombination. It will be further understood that various changes in the details, materials, and arrangements of the parts that have been described and illustrated herein may be made by those skilled in the art without departing from the scope of the following claims.
Number | Name | Date | Kind |
---|---|---|---|
4164763 | Briccetti et al. | Aug 1979 | A |
4608839 | Tibbals, Jr. | Sep 1986 | A |
4821178 | Levin et al. | Apr 1989 | A |
5319645 | Bassi et al. | Jun 1994 | A |
5537534 | Voigt et al. | Jul 1996 | A |
5539907 | Srivastava et al. | Jul 1996 | A |
5627995 | Miller et al. | May 1997 | A |
5710724 | Burrows | Jan 1998 | A |
5732273 | Srivastava et al. | Mar 1998 | A |
5860137 | Raz et al. | Jan 1999 | A |
5896538 | Blandy et al. | Apr 1999 | A |
5903730 | Asai et al. | May 1999 | A |
5940618 | Blandy et al. | Aug 1999 | A |
5940841 | Schmuck et al. | Aug 1999 | A |
5987250 | Subrahmanyam | Nov 1999 | A |
5999842 | Harrison et al. | Dec 1999 | A |
6226787 | Serra et al. | May 2001 | B1 |
6327699 | Larus et al. | Dec 2001 | B1 |
6353805 | Zahir et al. | Mar 2002 | B1 |
6470478 | Bargh et al. | Oct 2002 | B1 |
6519766 | Barritz et al. | Feb 2003 | B1 |
6643654 | Patel et al. | Nov 2003 | B1 |
6654948 | Konuru et al. | Nov 2003 | B1 |
6658471 | Berry et al. | Dec 2003 | B1 |
6658654 | Berry et al. | Dec 2003 | B1 |
6870929 | Greene | Mar 2005 | B1 |
7099797 | Richard | Aug 2006 | B1 |
7143410 | Coffman et al. | Nov 2006 | B1 |
7251663 | Smith | Jul 2007 | B1 |
7315795 | Homma | Jan 2008 | B2 |
7389497 | Edmark et al. | Jun 2008 | B1 |
7421681 | DeWitt, Jr. et al. | Sep 2008 | B2 |
7552125 | Evans | Jun 2009 | B1 |
7574587 | DeWitt, Jr. et al. | Aug 2009 | B2 |
7672005 | Hobbs et al. | Mar 2010 | B1 |
7714747 | Fallon | May 2010 | B2 |
7814218 | Knee et al. | Oct 2010 | B1 |
7827136 | Wang et al. | Nov 2010 | B1 |
7908436 | Srinivasan et al. | Mar 2011 | B1 |
8200923 | Healey et al. | Jun 2012 | B1 |
8335899 | Meiri et al. | Dec 2012 | B1 |
8478951 | Healey et al. | Jul 2013 | B1 |
9037822 | Meiri et al. | May 2015 | B1 |
9104326 | Frank et al. | Aug 2015 | B2 |
9128942 | Pfau et al. | Sep 2015 | B1 |
9208162 | Hallak et al. | Dec 2015 | B1 |
9270592 | Sites | Feb 2016 | B1 |
9286003 | Hallak et al. | Mar 2016 | B1 |
9304889 | Chen et al. | Apr 2016 | B1 |
9330048 | Bhatnagar et al. | May 2016 | B1 |
9342465 | Meiri | May 2016 | B1 |
9378106 | Ben-Moshe et al. | Jun 2016 | B1 |
9396243 | Halevi et al. | Jul 2016 | B1 |
9418131 | Halevi et al. | Aug 2016 | B1 |
9762460 | Pawlowski et al. | Sep 2017 | B2 |
9769254 | Gilbert et al. | Sep 2017 | B2 |
9785468 | Mitchell et al. | Oct 2017 | B2 |
20020056031 | Skiba et al. | May 2002 | A1 |
20020133512 | Milillo | Sep 2002 | A1 |
20030023656 | Hutchison et al. | Jan 2003 | A1 |
20030079041 | Parrella, Sr. et al. | Apr 2003 | A1 |
20030126122 | Bosley et al. | Jul 2003 | A1 |
20030145251 | Cantrill | Jul 2003 | A1 |
20040030721 | Kruger et al. | Feb 2004 | A1 |
20040267835 | Zwilling et al. | Dec 2004 | A1 |
20050039171 | Avakian et al. | Feb 2005 | A1 |
20050102547 | Keeton et al. | May 2005 | A1 |
20050125626 | Todd | Jun 2005 | A1 |
20050144416 | Lin | Jun 2005 | A1 |
20050171937 | Hughes et al. | Aug 2005 | A1 |
20050177603 | Shavit | Aug 2005 | A1 |
20050193084 | Todd et al. | Sep 2005 | A1 |
20050278346 | Shang et al. | Dec 2005 | A1 |
20060031653 | Todd et al. | Feb 2006 | A1 |
20060031787 | Ananth et al. | Feb 2006 | A1 |
20060047776 | Chieng et al. | Mar 2006 | A1 |
20060070076 | Ma | Mar 2006 | A1 |
20060123212 | Yagawa | Jun 2006 | A1 |
20060242442 | Armstrong et al. | Oct 2006 | A1 |
20070078982 | Aidun et al. | Apr 2007 | A1 |
20070208788 | Chakravarty et al. | Sep 2007 | A1 |
20070297434 | Arndt et al. | Dec 2007 | A1 |
20080163215 | Jiang et al. | Jul 2008 | A1 |
20080178050 | Kern et al. | Jul 2008 | A1 |
20080243952 | Webman | Oct 2008 | A1 |
20080288739 | Bamba et al. | Nov 2008 | A1 |
20090006745 | Cavallo et al. | Jan 2009 | A1 |
20090030986 | Bates | Jan 2009 | A1 |
20090049450 | Dunshea et al. | Feb 2009 | A1 |
20090055613 | Maki | Feb 2009 | A1 |
20090089483 | Tanaka et al. | Apr 2009 | A1 |
20090100108 | Chen et al. | Apr 2009 | A1 |
20090222596 | Flynn et al. | Sep 2009 | A1 |
20090319996 | Shafi et al. | Dec 2009 | A1 |
20100042790 | Mondal | Feb 2010 | A1 |
20100088296 | Periyagaram | Apr 2010 | A1 |
20100180145 | Chu | Jul 2010 | A1 |
20100199066 | Artan et al. | Aug 2010 | A1 |
20100205330 | Noborikawa et al. | Aug 2010 | A1 |
20100223619 | Jaquet et al. | Sep 2010 | A1 |
20100257149 | Cognigni et al. | Oct 2010 | A1 |
20110060722 | Li et al. | Mar 2011 | A1 |
20110078494 | Maki | Mar 2011 | A1 |
20110083026 | Mikami et al. | Apr 2011 | A1 |
20110099342 | Ozdemir | Apr 2011 | A1 |
20110119679 | Muppirala et al. | May 2011 | A1 |
20110161297 | Parab | Jun 2011 | A1 |
20110202744 | Kulkarni et al. | Aug 2011 | A1 |
20110225122 | Denuit et al. | Sep 2011 | A1 |
20110289291 | Agombar | Nov 2011 | A1 |
20120054472 | Altman et al. | Mar 2012 | A1 |
20120059799 | Oliveira et al. | Mar 2012 | A1 |
20120078852 | Haselton et al. | Mar 2012 | A1 |
20120124282 | Frank et al. | May 2012 | A1 |
20120158736 | Milby | Jun 2012 | A1 |
20120278793 | Jalan et al. | Nov 2012 | A1 |
20120290546 | Smith et al. | Nov 2012 | A1 |
20120290798 | Huang et al. | Nov 2012 | A1 |
20120304024 | Rohleder et al. | Nov 2012 | A1 |
20130031077 | Liu et al. | Jan 2013 | A1 |
20130054524 | Anglin et al. | Feb 2013 | A1 |
20130073527 | Bromley | Mar 2013 | A1 |
20130110783 | Wertheimer et al. | May 2013 | A1 |
20130111007 | Hoffmann et al. | May 2013 | A1 |
20130138607 | Bashyam et al. | May 2013 | A1 |
20130151683 | Jain et al. | Jun 2013 | A1 |
20130151759 | Shim et al. | Jun 2013 | A1 |
20130198854 | Erway et al. | Aug 2013 | A1 |
20130246354 | Clayton | Sep 2013 | A1 |
20130246724 | Furuya | Sep 2013 | A1 |
20130265883 | Henry et al. | Oct 2013 | A1 |
20130282997 | Suzuki et al. | Oct 2013 | A1 |
20130318051 | Kumar et al. | Nov 2013 | A1 |
20130332610 | Beveridge | Dec 2013 | A1 |
20140040199 | Golab et al. | Feb 2014 | A1 |
20140136759 | Sprouse et al. | May 2014 | A1 |
20140143206 | Pittelko | May 2014 | A1 |
20140161348 | Sutherland et al. | Jun 2014 | A1 |
20140195484 | Wang | Jul 2014 | A1 |
20140237201 | Swift | Aug 2014 | A1 |
20140297588 | Babashetty et al. | Oct 2014 | A1 |
20140359231 | Matthews | Dec 2014 | A1 |
20140380282 | Ravindranath Sivalingam et al. | Dec 2014 | A1 |
20150006910 | Shapiro | Jan 2015 | A1 |
20150088823 | Chen et al. | Mar 2015 | A1 |
20150112933 | Satapathy | Apr 2015 | A1 |
20150149739 | Seo et al. | May 2015 | A1 |
20150161194 | Provenzano et al. | Jun 2015 | A1 |
20150205816 | Periyagaram | Jul 2015 | A1 |
20150249615 | Chen et al. | Sep 2015 | A1 |
20150324236 | Gopalan et al. | Nov 2015 | A1 |
20160034692 | Singler | Feb 2016 | A1 |
20160042285 | Gilenson et al. | Feb 2016 | A1 |
20160062853 | Sugabrahmam | Mar 2016 | A1 |
20160080482 | Gilbert et al. | Mar 2016 | A1 |
20160188419 | Dagar et al. | Jun 2016 | A1 |
20160350391 | Vijayan et al. | Dec 2016 | A1 |
20160359968 | Chitti et al. | Dec 2016 | A1 |
20160366206 | Shemer et al. | Dec 2016 | A1 |
20170123704 | Sharma et al. | May 2017 | A1 |
20170139786 | Simon et al. | May 2017 | A1 |
20170161348 | Araki et al. | Jun 2017 | A1 |
Number | Date | Country |
---|---|---|
1804157 | Jul 2007 | EP |
WO 2010019596 | Feb 2010 | WO |
WO 2010040078 | Apr 2010 | WO |
WO 2012066528 | May 2012 | WO |
Entry |
---|
Response to U.S. Non-Final Office Action dated Jul. 6, 2017 for U.S. Appl. No. 14/494,895; Response dated Oct. 3, 2017; 10 Pages. |
U.S. Non-Final Office Action dated Jul. 6, 2017 for U.S. Appl. No. 14/494,895; 36 Pages. |
Response to U.S. Final Office Action dated Apr. 6, 2016 corresponding to U.S. Appl. No. 14/034,981; Response dated Jun. 16, 2016; 11 Pages. |
Notice of Allowance dated Jun. 29, 2016 corresponding to U.S. Appl. No. 14/034,981; 14 Pages. |
Notice of Allowance dated May 20, 2016 corresponding to U.S. Appl. No. 14/037,577; 19 Pages. |
Notice of Allowance dated Jun. 6, 2016 corresponding to U.S. Appl. No. 14/317,449; 43 Pages. |
U.S. Appl. No. 14/034,981, filed Sep. 24, 2013, Halevi et al. |
U.S. Appl. No. 14/037,577, filed Sep. 26, 2013, Ben-Moshe et al. |
U.S. Appl. No. 14/230,405, filed Mar. 31, 2014, Meiri et al. |
U.S. Appl. No. 14/230,414, filed Mar. 31, 2014, Meiri. |
U.S. Appl. No. 14/317,449, filed Jun. 27, 2014, Halevi et al. |
U.S. Appl. No. 14/494,895, filed Sep. 24, 2014, Meiri et al. |
U.S. Appl. No. 14/494,899, filed Sep. 24, 2014, Chen et al. |
U.S. Appl. No. 14/979,890, filed Dec. 28, 2015, Meiri et al. |
U.S. Appl. No. 15/001,784, filed Jan. 20, 2016, Meiri et al. |
U.S. Appl. No. 15/001,789, filed Jan. 20, 2016, Meiri et al. |
U.S. Appl. No. 15/085,168, filed Mar. 30, 2016, Meiri et al. |
U.S. Appl. No. 15/076,775, filed Mar. 22, 2016, Chen et al. |
U.S. Appl. No. 15/076,946, filed Mar. 22, 2016, Meiri. |
U.S. Appl. No. 15/085,172, filed Mar. 30, 2016, Meiri. |
U.S. Appl. No. 15/085,188, filed Mar. 30, 2016, Meiri et al. |
PCT International Search Report and Written Opinion dated Dec. 1, 2011 for PCT Application No. PCT/IL2011/000692; 11 Pages. |
PCT International Preliminary Report dated May 30, 2013 for PCT Patent Application No. PCT/IL2011/000692; 7 Pages. |
U.S. Appl. No. 12/945,915. |
Nguyen et al., “B+ Hash Tree: Optimizing Query Execution Times for on-Disk Semantic Web Data Structures;” Proceedings of the 6th International Workshop on Scalable Semantic Web Knowledge Base Systems; Shanghai, China, Nov. 8, 2010; 16 Pages. |
Notice of Allowance dated Apr. 13, 2015 corresponding to U.S. Appl. No. 14/037,511; 11 Pages. |
Non-Final Office Action dated May 11, 2015 corresponding to U.S. Appl. No. 14/037,626; 13 Pages. |
Response to Office Action dated May 11, 2015 corresponding to U.S. Appl. No. 14/037,626; Response dated Jul. 20, 2015; 10 Pages. |
Notice of Allowance dated Oct. 26, 2015 corresponding to U.S. Appl. No. 14/037,626; 12 Pages. |
Office Action dated Jul. 22, 2015 corresponding to U.S. Appl. No. 14/034,981; 28 Pages. |
Response to Office Action dated Jul. 22, 2015 corresponding to U.S. Appl. No. 14/034,981; Response dated Dec. 22, 2015; 14 Pages. |
Office Action dated Sep. 1, 2015 corresponding to U.S. Appl. No. 14/230,414; 13 Pages. |
Response to Office Action dated Sep. 1, 2015 corresponding to U.S. Appl. No. 14/230.414; Response dated Jan. 14, 2016; 10 Pages. |
Restriction Requirement dated Sep. 24, 2015 corresponding to U.S. Appl. No. 14/230,405; 8 Pages. |
Response to Restriction Requirement dated Sep. 24, 2015 corresponding to U.S. Appl. No. 14/230,405;Response dated Oct. 6, 2015; 1 Page. |
Office Action dated Dec. 1, 2015 corresponding to U.S. Appl. No. 14/230,405; 17 Pages. |
Office Action dated Feb. 4, 2016 corresponding to U.S. Appl. No. 14/087,577; 26 Pages. |
Notice of Allowance dated Feb. 10, 2016 corresponding to U.S. Appl. No. 14/494,899; 19 Pages. |
Notice of Allowance dated Feb. 26, 2016 corresponding to U.S. Appl. No. 14/230,414; 8 Pages. |
Final Office Action dated Apr. 6, 2016 corresponding to U.S. Appl. No. 14/034,981; 38 Pages. |
U.S. Final Office Action dated Nov. 2, 2017 for U.S. Appl. No. 14/494,895; 12 Pages. |
Office Action dated Nov. 1, 2017 corresponding to U.S. Appl. No. 15/196,374, 64 Pages. |
U.S. Non-Final Office Action dated Dec. 1, 2017 for U.S. Appl. No. 14/979,890; 10 Pages. |
U.S. Non-Final Office Action dated Dec. 11, 2017 for U.S. Appl. No. 15/196,447; 54 Pages. |
U.S. Non-Final Office Action dated Dec. 14, 2017 for U.S. Appl. No. 15/076,946; 28 Pages. |
Response dated May 2, 2016 to the Non-Final Office Action dated Dec. 1, 2015; for U.S. Appl. No. 14/230,405; 8 pages. |
Response dated May 2, 2016 to the Non-Final Office Action dated Feb. 4, 2016; for U.S. Appl. No. 14/037,577; 10 pages. |
U.S. Appl. No. 15/196,674, filed Jun. 29, 2016, Kleiner, et al. |
U.S. Appl. No. 15/196,427, filed Jun. 29, 2016, Shveidel. |
U.S. Appl. No. 15/196,374, filed Jun. 29, 2016, Shveidel, et al. |
U.S. Appl. No. 15/196,447, filed Jun. 29, 2016, Shveidel, et al. |
U.S. Appl. No. 15/196,472, filed Jun. 29, 2016, Shveidel. |
U.S. Non-Final Office Action dated Jan. 11, 2018 corresponding to U.S. Appl. No. 15/085,168; 14 Pages. |
U.S. Non-Final Office Action dated Dec. 29, 2017 corresponding to U.S. Appl. No. 15/196,674; 34 Pages. |
U.S. Non-Final Office Action dated Jan. 8, 2018 corresponding to U.S. Appl. No. 15/196,472; 16 Pages. |