公开(公告)号：US06374264B1

公开(公告)日：2002-04-16

申请号：US09207926

申请日：1998-12-09

申请人： Philip L. Bohannon ,  Rajeev Rastogi ,  Srinivasan Seshadri ,  Abraham Silberschatz ,  Sundararajarao Sudarshan

发明人： Philip L. Bohannon ,  Rajeev Rastogi ,  Srinivasan Seshadri ,  Abraham Silberschatz ,  Sundararajarao Sudarshan

IPC分类号： G06F1730

CPC分类号： G06F11/1474 ,  G06F11/1471 ,  G06F2201/80 ,  Y10S707/99932 ,  Y10S707/99953

摘要： A method of detecting and recovering from data corruption of a database is characterized by the step of protecting data of the database with codewords, one codeword for each region of the database; and verifying that a codeword matches associated data before the data is read from the database to prevent transaction-carried corruption. A deferred maintenance scheme is recommended for the codewords protecting the database such that the method of detecting and recovering from data corruption of a database may comprise the steps of protecting data of the database with codewords, one codeword for each region of the database; and asynchronously maintaining the codewords to improve concurrency of the database. Moreover, the database may be audited by using the codewords and noting them in a table and protecting regions of the database with latches. Once codeword values are computed and checked against noted values in memory, a flush can cause codewords from outstanding log records to be applied to the stored codeword table.

摘要翻译： 一种从数据库的数据损坏中检测和恢复的方法的特征在于利用码字保护数据库的数据的步骤，数据库的每个区域的一个码字; 并且在从数据库读取数据之前验证码字匹配相关联的数据以防止交易携带的损坏。 对于保护数据库的代码字，建议使用延迟维护方案，以便检测和恢复数据库的数据损坏的方法可以包括以下代码字来保护数据库的数据的步骤，数据库的每个区域的一个代码字; 并且异步地维护码字以改善数据库的并发性。 此外，可以通过使用码字来审核数据库，并在表中注明数据库，并用锁存器保护数据库的区域。 一旦根据存储器中的标记值计算和检查码字值，则刷新可以使来自未完成的日志记录的码字被应用于存储的码字表。

公开(公告)号：US6122645A

公开(公告)日：2000-09-19

申请号：US2635

申请日：1998-01-05

申请人： Philip L. Bohannon ,  Dennis W. Leinbaugh ,  Rajeev Rastogi ,  Srinivasan Seshadri ,  Abraham Silberschatz ,  Sundararajarao Sudarshan

发明人： Philip L. Bohannon ,  Dennis W. Leinbaugh ,  Rajeev Rastogi ,  Srinivasan Seshadri ,  Abraham Silberschatz ,  Sundararajarao Sudarshan

IPC分类号： G06F17/30

CPC分类号： G06F17/30309 ,  Y10S707/99953 ,  Y10S707/99954

摘要： For use with a database of data records organized into components, the database stored in a memory, a processing system for, and method of, physically versioning the database. In one embodiment, the processing system includes: (1) a component copier that creates a physical copy of an original component to be affected by an update transaction to be applied to the database, and that causes pointers in nodes of the physical copy to point to other nodes in the physical copy, (2) a data updater, associated with the component copier, that applies the update transaction to the physical copy to create therefrom a new physical version, the original component remaining unaffected by the update transaction and (3) a pointer updater, associated with the data updated, that employs an atomic word write to revise a component pointer, associated with the database, to cause the pointer to point to the new physical version.

摘要翻译： 为了与组织成组件的数据记录的数据库一起使用，存储在内存中的数据库，处理系统以及对数据库进行物理版本化的方法。 在一个实施例中，处理系统包括：（1）组件复印机，其创建将要被应用于数据库的更新事务影响的原始组件的物理副本，并且使物理副本的节点中的指针指向 到物理副本中的其他节点，（2）与组件复印机相关联的数据更新器，将更新事务应用于物理副本以从其创建新的物理版本，原始组件不受更新事务的影响，（3 ）与更新的数据相关联的指针更新器，其使用原子字写入来修改与数据库相关联的组件指针，以使指针指向新的物理版本。

公开(公告)号：US6079028A

公开(公告)日：2000-06-20

申请号：US839188

申请日：1997-04-23

申请人： Banu Ozden ,  Rajeev Rastogi ,  Prashant J. Shenoy ,  Abraham Silberschatz

发明人： Banu Ozden ,  Rajeev Rastogi ,  Prashant J. Shenoy ,  Abraham Silberschatz

IPC分类号： G06F11/10 ,  G06F11/00

CPC分类号： G06F11/1076 ,  G06F2211/1016

摘要： A continuous media server that provides support for the storage and retrieval of continuous media data at guaranteed rates using one of two fault-tolerant approaches that rely on admission control in order to meet rate guarantees in the event of a failure of the data storage medium that renders part of the continuous media inaccessible. In the first approach, a declustered parity storage scheme is used to uniformly distribute the additional load caused by a disk failure, uniformly across the disks. Contingency bandwidth for a certain number of clips is reserved on each disk in order to retrieve the additional blocks. In the second approach, data blocks in a parity group are prefetched and thus in the event of a disk failure only one additional parity block is retrieved for every data block to be reconstructed. While the second approach generates less additional load in the event of a failure, it has higher buffer requirements. For the second approach, parity blocks can either be stored on a separate parity disk, or distributed among the disks with contingency bandwidth reserved on each disk.

摘要翻译： 一种连续的媒体服务器，其以保证的速率提供对连续媒体数据的存储和检索的支持，使用依赖于准入控制的两种容错方法之一，以便在数据存储介质发生故障的情况下满足速率保证 使部分连续媒体无法访问。 在第一种方法中，使用解聚奇偶校验存储方案来均匀地分布由磁盘故障引起的附加负载，均匀地分布在磁盘上。 为了检索附加的块，在每个磁盘上保留一定数量的剪辑的应急带宽。 在第二种方法中，奇偶校验组中的数据块被预取，因此在发生磁盘故障的情况下，仅针对要重建的每个数据块检索一个附加奇偶校验块。 虽然第二种方法在发生故障时产生较少的额外负载，但它具有较高的缓冲区要求。 对于第二种方法，奇偶校验块可以存储在单独的奇偶校验磁盘上，或者分布在每个磁盘上预留有应急带宽的磁盘之间。

公开(公告)号：US6012080A

公开(公告)日：2000-01-04

申请号：US624013

申请日：1996-03-27

申请人： Banu Ozden ,  Rajeev Rastogi ,  Abraham Silberschatz

发明人： Banu Ozden ,  Rajeev Rastogi ,  Abraham Silberschatz

IPC分类号： G06F12/00 ,  G06F9/48 ,  H04L12/58 ,  H04N7/16 ,  H04N7/173 ,  H04N21/2315 ,  H04N21/262 ,  G06F9/46

CPC分类号： G06F9/4881 ,  H04N21/2312 ,  H04N7/17336

摘要： A method and an apparatus are disclosed for providing enhanced pay per view in a video server. Specifically, the present invention periodically schedules a group of non pre-emptible tasks corresponding to videos in a video server having a predetermined number of processors, wherein each task is defined by a computation time and a period. To schedule the group of tasks, the present invention divides the tasks into two groups according to whether they may be scheduled on less than one processor. The present invention schedules each group separately. For the group of tasks scheduleable on less than one processor, the present invention conducts a first determination of scheduleability. If the first determination of scheduleability deems the group of tasks not scheduleable, then the present invention conducts a second determination of scheduleability. If the second determination of scheduleability also deems the group of tasks not scheduleable, then the present invention recursively partitions the group of tasks in subsets and re-performs the second determination of scheduleability. Recursive partitioning continues until the group of tasks is deemed scheduleable or no longer partitionable. In the latter case, the group of tasks is deemed not scheduleable.

摘要翻译： 公开了一种用于在视频服务器中提供增强的每次视图的方法和装置。 具体地，本发明定期地对具有预定数量的处理器的视频服务器中的视频对应的一组不可预先排除的任务进行调度，其中每个任务由计算时间和周期来定义。 为了安排该组任务，本发明根据它们是否可以在不到一个处理器上进行调度来将任务分成两组。 本发明分别安排每组。 对于可在不到一个处理器上调度的任务组，本发明进行可调度性的第一确定。 如果第一次确定可调度性，则认为该组任务不可计划，则本发明进行可调度性的第二确定。 如果对可调度性的第二确定也认为该组任务不可调度，则本发明递归地分组子集中的任务组并且重新执行可调度性的第二确定。 递归分区继续进行，直到任务组被视为可安排或不再可分区。 在后一种情况下，该组任务被视为不可计划。

公开(公告)号：US5870551A

公开(公告)日：1999-02-09

申请号：US629118

申请日：1996-04-08

申请人： Banu Ozden ,  Rajeev Rastogi ,  Abraham Silberschatz

发明人： Banu Ozden ,  Rajeev Rastogi ,  Abraham Silberschatz

IPC分类号： G06F12/08 ,  G06F3/06 ,  G06F12/12 ,  G06F12/00 ,  G06F13/14 ,  H04N7/16

CPC分类号： G06F12/121

摘要： Two methods are disclosed for storing multimedia data that reduces the amount of disk I/O required by the system and cache misses experienced by the system. The first method determines the future access of each data buffer in a cache memory. Once the future of the data buffer is determined, the data buffer with the maximum future is allocated to store new blocks of data. The method approximates an optimal method of data buffer allocation, by calculating the future of a data buffer, relative to clients that will access the data buffers. The second method orders the clients based on the increasing distance of each client from the previous client; clients release the buffers in this order into a LIFO queue; if a buffer is selected to load a new block of data, the buffer at the head of the LIFO queue is selected.

摘要翻译： 公开了用于存储减少系统所需的盘I / O量和系统经历的高速缓存未命中的多媒体数据的两种方法。 第一种方法确定高速缓冲存储器中每个数据缓冲区的将来访问。 一旦确定了数据缓冲区的未来，则分配具有最大未来的数据缓冲器来存储新的数据块。 该方法通过相对于将访问数据缓冲区的客户端计算数据缓冲区的未来，逼近数据缓冲区分配的最佳方法。 第二种方法是根据每个客户端与以前的客户端的距离不断增加来定购客户端; 客户端将缓冲区按此顺序释放到LIFO队列中; 如果选择缓冲区来加载新的数据块，则选择LIFO队列头部的缓冲区。

公开(公告)号：US5721956A

公开(公告)日：1998-02-24

申请号：US440737

申请日：1995-05-15

申请人： Clifford Eric Martin ,  Banu Ozden ,  Rajeev Rastogi ,  Abraham Silberschatz

发明人： Clifford Eric Martin ,  Banu Ozden ,  Rajeev Rastogi ,  Abraham Silberschatz

IPC分类号： G06F3/06 ,  H04N7/173 ,  H04N7/24 ,  G06F13/14

CPC分类号： G06F3/0613 ,  G06F3/0656 ,  G06F3/0674 ,  H04N7/17336 ,  H04N7/24

摘要： Buffer space and disk bandwidth resources in a continuous media server are continuously re-allocated in order to optimize the number of continuous media requests which may be concurrently serviced at guaranteed transfer rates using on demand paging. Disk scheduling is provided to ensure that whenever an admitted request references a page of data, the page is available in a buffer for transfer to a client. Data for continuous media data files are stored on disk or held in the buffer to eliminate disk bandwidth limitations associated with concurrently servicing any number or combination of requests, provided buffer space is sufficient. Multiple requests for continuous media data files are selectively included in groups for servicing in order to provide that buffer and disk bandwidth requirements are maintained at a minimum and within available resource capabilities.

摘要翻译： 持续重新分配连续媒体服务器中的缓冲区空间和磁盘带宽资源，以便优化连续媒体请求的数量，可以使用按需分页在保证的传输速率下同时提供服务。 提供磁盘调度以确保每当收到的请求引用一页数据时，该页面在缓冲区中可用于传输到客户端。 连续媒体数据文件的数据存储在磁盘上或保存在缓冲区中，以消除与同时服务任何数量或组合的请求相关联的磁盘带宽限制，只要缓冲区空间就足够了。 连续媒体数据文件的多个请求被选择性地包括在用于服务的组中，以便将缓冲器和磁盘带宽要求保持在最小并且在可用资源能力内。

公开(公告)号：US09171006B2

公开(公告)日：2015-10-27

申请号：US11783137

申请日：2007-04-06

申请人： Naidu Kvm ,  Rajeev Rastogi ,  Jeyashankher Sr ,  Anand Srinivasan

发明人： Naidu Kvm ,  Rajeev Rastogi ,  Jeyashankher Sr ,  Anand Srinivasan

IPC分类号： G06F17/30

CPC分类号： H04L67/1095 ,  G06F17/30132 ,  H04L67/1097 ,  H04L67/2847

摘要： Disclosed is a mobile station having an expanded storage space, and a method of retrieving a file stored in a remote storage server. The method may include determining whether the file is locally stored or remotely stored, deleting files in a local storage to provide space if the file is determined to reside in a remote storage server, downloading the file from a remote storage server over the Internet by prefetching a portion of the file from the remote storage server, and opening the prefetched portion of the file while concurrently downloading a remaining portion of the file from the remote storage server.

摘要翻译： 公开了具有扩展的存储空间的移动台以及检索存储在远程存储服务器中的文件的方法。 该方法可以包括确定文件是本地存储还是远程存储，如果文件被确定驻留在远程存储服务器中，则删除本地存储器中的文件以提供空间，通过预取来从远程存储服务器通过因特网下载文件 来自远程存储服务器的文件的一部分，并且在同时从远程存储服务器下载文件的剩余部分的同时打开文件的预取部分。

公开(公告)号：US08028050B2

公开(公告)日：2011-09-27

申请号：US10462215

申请日：2003-06-13

申请人： Giuseppe F. Italiano ,  Rajeev Rastogi ,  Bulent Yener

发明人： Giuseppe F. Italiano ,  Rajeev Rastogi ,  Bulent Yener

IPC分类号： G06F15/177 ,  G06F15/173

CPC分类号： H04L63/0272 ,  H04L12/4641 ,  H04L45/22 ,  H04L45/28 ,  H04L45/48

摘要： Restoration is provided in a communication system having two or more VPN endpoints coupled together through a network comprising a number of nodes interconnected through edges. VPN endpoints coupled through the network are adapted to communicate through a single connection with multiple other VPN endpoints. The single connection may be a VPN hose connection. A restoration topology, comprising backup edges corresponding to primary edges in the network, is determined for the network. A given primary edge is replaced with one or more backup edges if the given primary edge fails. A graph may represent the network and a tree may represent the connections in the network for VPNs connecting the VPN endpoints. The graph can be reduced to a second graph by determining shortest paths between each node in the tree and creating the backup edges from the shortest paths. The second graph can be reduced to a third graph by adding additional backup edges from tree nodes having non-tree edges to least common ancestor nodes. The third graph can be used to create a two-edge connected tree.

摘要翻译： 在具有通过包括通过边缘互连的多个节点的网络的网络耦合在一起的两个或更多个VPN端点的通信系统中提供恢复。 通过网络耦合的VPN端点适于通过与多个其他VPN端点的单个连接进行通信。 单个连接可能是VPN软件连接。 为网络确定包括与网络中的主边缘相对应的备份边缘的恢复拓扑。 如果给定的主边缘发生故障，给定的主边缘将被一个或多个备用边替换。 图表可以表示网络，并且树可以表示网络中连接VPN端点的VPN的连接。 通过确定树中每个节点之间的最短路径并从最短路径创建备份边，可将图形简化为第二个图。 通过从具有非树形边缘的树节点向最不常见的祖先节点添加额外的备份边，可以将第二个图形简化为第三个图形。 第三个图可用于创建一个双边连接的树。

公开(公告)号：US07783647B2

公开(公告)日：2010-08-24

申请号：US11301387

申请日：2005-12-13

申请人： Graham R. Cormode ,  Minos N. Garofalakis ,  Shanmugavelayutham Muthukrishnan ,  Rajeev Rastogi

发明人： Graham R. Cormode ,  Minos N. Garofalakis ,  Shanmugavelayutham Muthukrishnan ,  Rajeev Rastogi

IPC分类号： G06F17/30

CPC分类号： H04L41/147 ,  H04L43/00 ,  H04L43/0894 ,  H04L43/16

摘要： The invention comprises a method and apparatus for determining a rank of a query value. Specifically, the method comprises receiving a rank query request, determining, for each of the at least one remote monitor, a predicted lower-bound rank value and upper-bound rank value, wherein the predicted lower-bound rank value and upper-bound rank value are determined according to at least one respective prediction model used by each of the at least one remote monitor to compute the at least one local quantile summary, computing a predicted average rank value for each of the at least one remote monitor using the at least one predicted lower-bound rank value and the at least one predicted upper-bound rank value associated with the respective at least one remote monitor, and computing the rank of the query value using the at least one predicted average rank value associated with the respective at least one remote monitor.

摘要翻译： 本发明包括一种用于确定查询值的等级的方法和装置。 具体地说，该方法包括：接收秩查询请求，为所述至少一个远程监视器中的每一个确定预测的下限秩值和上限秩值，其中预测的下限秩值和上限秩 根据由所述至少一个远程监视器中的每一个使用的至少一个相应的预测模型来确定所述值，以计算所述至少一个本地分位数概要，使用所述至少一个远程监视器至少计算所述至少一个远程监视器中的每一个的预测平均等级值 一个预测的下限秩值和与相应的至少一个远程监视器相关联的至少一个预测的上限秩值，以及使用与各自的至少一个远程监视器相关联的至少一个预测平均等级值来计算查询值的等级 至少一个远程监视器。

公开(公告)号：US20090210489A1

公开(公告)日：2009-08-20

申请号：US12032755

申请日：2008-02-18

申请人： Supratim Deb ,  Rajeev Rastogi ,  Anand Srinivasan ,  Prakash Linga

发明人： Supratim Deb ,  Rajeev Rastogi ,  Anand Srinivasan ,  Prakash Linga

IPC分类号： G06F15/16

CPC分类号： H04L67/104 ,  H04L67/1076

摘要： The invention improves query response latency in a peer-to-peer network. The invention augments core neighbors included in a neighbor list of a peer node by selecting auxiliary neighbors for inclusion in the neighbor list of the peer node of a peer-to-peer network. In one embodiment, a method includes maintaining query frequency information associated with each of a plurality of peer nodes of the peer-to-peer network, selecting at least one of the peer nodes of the peer-to-peer network as an auxiliary neighbor using the query frequency information, and updating a neighbor list to include the at least one peer node selected as the at least one auxiliary neighbor. The core neighbors stored at a peer node attempt to minimize the worst-case query latency for that peer node. The auxiliary neighbors stored at the peer node attempt to reduce the average query latency for that peer node. The auxiliary neighbors may be used in any peer-to-peer system, such as Pastry, Tapestry, Chord, SkipGraph, and the like.

摘要翻译： 本发明改进了对等网络中的查询响应等待时间。 本发明通过选择用于包括在对等网络的对等节点的邻居列表中的辅助邻居来增加包括在对等节点的邻居列表中的核心邻居。 在一个实施例中，一种方法包括维护与所述对等网络的多个对等节点中的每一个相关联的查询频率信息，将对等网络中的至少一个对等节点选择为辅助邻居，使用 所述查询频率信息，以及更新邻居列表以包括被选择为所述至少一个辅助邻居的所述至少一个对等节点。 存储在对等节点处的核心邻居尝试最小化该对等节点的最差情况查询延迟。 存储在对等节点处的辅助邻居尝试减少该对等节点的平均查询延迟。 辅助邻居可以用于任何对等系统，例如糕点，挂毯，和弦，SkipGraph等。