公开(公告)号：US06343296B1

公开(公告)日：2002-01-29

申请号：US09389337

申请日：1999-09-03

申请人： Mohana Krishna Lakhamraju ,  Rajeev Rastogi ,  Srinivasan Seshadri ,  Sundararajarao Sudarshan

发明人： Mohana Krishna Lakhamraju ,  Rajeev Rastogi ,  Srinivasan Seshadri ,  Sundararajarao Sudarshan

IPC分类号： G06F1730

CPC分类号： G06F17/30607 ,  Y10S707/99938 ,  Y10S707/99943 ,  Y10S707/99944

摘要： An on-line reorganization method of an object-oriented database with physical references involves a novel fuzzy traversal of the database, or a partition thereof, to identify the approximate parents of all migrating objects. Where the entire database is traversed the process begins from its persistent root. For traversals of a partition the process begins from each object with a reference pointing to it from outside the partition. To facilitate the identification of these inter-partitional objects an External Reference Table (“ERT”) is maintained. During the fuzzy traversal all new inserted and deleted references are tracked in a Temporary Reference Table (“TRT”). After the fuzzy traversal is completed, for each migrating object, a lock is obtained on the identified approximate parents and on all new parents in which references to the object were inserted, as indicated by the TRT. Based on the information in the TRT, locks are released on all approximate parents whose references to the object have been deleted. The references to the migrating object in the remaining set of locked parents are updated, the object is relocated and the locks are released. Alternatively, each parent of a migrating object can be individually locked, updated and released.

摘要翻译： 具有物理引用的面向对象数据库的在线重组方法涉及数据库或其分区的新颖的模糊遍历，以识别所有迁移对象的近似父母。 在整个数据库遍历的过程中，进程从其持久根开始。 对于遍历分区，进程从每个对象开始，引用从分区外部引用它。 为了便于识别这些跨部门对象，维护了外部参考表（“ERT”）。 在模糊遍历期间，所有新插入和删除的引用将在临时参考表（“TRT”）中进行跟踪。 模糊遍历完成后，对于每个迁移对象，在所标识的近似父母以及所有新父母上获取锁定，其中插入了对象的引用，如TRT所示。 根据TRT中的信息，在对对象的引用已被删除的所有近似父类上释放锁。 在剩余的一组锁定的父项中对迁移对象的引用被更新，对象被重新定位并且锁被释放。 或者，可以单独锁定，更新和释放迁移对象的每个父项。

公开(公告)号：US5964829A

公开(公告)日：1999-10-12

申请号：US624011

申请日：1996-03-27

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

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

IPC分类号： G06F15/173 ,  G06F9/46 ,  G06F9/48 ,  H04N5/765 ,  H04N5/93 ,  H04N7/16 ,  H04N7/173 ,  H04N21/2315 ,  H04N21/262

CPC分类号： H04N7/17336

摘要： A method and 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 begins at predetermined periods and has a set of sub-tasks separated by predetermined intervals. To schedule the group of tasks, the present invention divides the tasks into two groups according to whether they may be scheduled on a single processor. The present invention schedules each group separately. For the group of tasks not scheduleable on a single processor, the present invention determines a number of processors required to schedule such group and schedules such tasks to start at a predetermined time. For the group of tasks scheduleable on a single processor, the present invention determines whether such tasks are scheduleable on the available processors using an array of time slots. If the present invention determines that such group of tasks are not scheduleable on the available processors, then the present invention recursively partitions such 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.

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

公开(公告)号：US5864849A

公开(公告)日：1999-01-26

申请号：US767048

申请日：1996-12-16

申请人： Philip Lewis Bohannon ,  Rajeev Rastogi ,  Abraham Silberschatz ,  Sundararajarao Sudarshan

发明人： Philip Lewis Bohannon ,  Rajeev Rastogi ,  Abraham Silberschatz ,  Sundararajarao Sudarshan

IPC分类号： G06F11/14 ,  G06F17/30

CPC分类号： G06F11/1469 ,  G06F11/1471 ,  Y10S707/99937 ,  Y10S707/99938 ,  Y10S707/99952 ,  Y10S707/99953

摘要： For use with an active database stored in volatile memory for direct revision thereof, the active database having multiple checkpoints and a stable log, having a tail stored in the volatile memory, for tracking revisions to the active database to allow corresponding revisions to be made to the multiple checkpoints, the active database subject to corruption, a system for, and method of, restoring the active database and a computer system containing the same. The system includes: (1) a checkpoint determination controller that determines which of the multiple checkpoints is a most recently completed checkpoint and copies the most recently completed checkpoint to the volatile memory to serve as an unrevised database for reconstructing the active database and (2) a revision application controller that retrieves selected ones of the revisions from the stable log and the tail and applies the revisions to the unrevised database thereby to restore the active database. In an advantageous embodiment, the applied revisions include log records at an operation level (lower level of abstration than transactions), and the revision application controller, using memory locks while restoring the active database, releases ones of the memory locks as a function of applying ones of the log records.

摘要翻译： 为了与存储在易失性存储器中的活动数据库一起用于其直接修订，活动数据库具有多个检查点和稳定的日志，其具有存储在易失性存储器中的尾部，用于跟踪活动数据库的修订以允许相应的修订 多个检查点，活动数据库受到破坏，恢复活动数据库的系统和方法以及包含该活动数据库的计算机系统。 该系统包括：（1）检查点确定控制器，其确定多个检查点中的哪一个是最近完成的检查点，并将最近完成的检查点复制到易失性存储器，以用作用于重建活动数据库的未修改的数据库;以及（2） 修订应用程序控制器，从稳定日志和尾部检索选定的修订版本，并将修订版本应用到未修改的数据库，从而恢复活动数据库。 在有利的实施例中，所应用的修订包括在操作级别（比交易更低级别）的日志记录，以及在恢复活动数据库时使用存储器锁定的修订应用程序控制器，释放作为应用的函数的存储器锁 一些日志记录。

公开(公告)号：US5845292A

公开(公告)日：1998-12-01

申请号：US766096

申请日：1996-12-16

申请人： Philip L. Bohannon ,  James Allen Parker ,  Rajeev Rastogi ,  Abraham Silberschatz

发明人： Philip L. Bohannon ,  James Allen Parker ,  Rajeev Rastogi ,  Abraham Silberschatz

IPC分类号： G06F17/30

CPC分类号： G06F11/1471 ,  G06F11/1469 ,  G06F2201/80 ,  Y10S707/99938 ,  Y10S707/99952 ,  Y10S707/99953

摘要： For use with a central database associated with a server of a network, the central database having distributed counterparts stored in volatile memories of clients of the network to allow operations to be performed locally thereon, the central database further having multiple checkpoints and a stable log stored in the server for tracking operations on the central database to allow corresponding operations to be made to the multiple checkpoints, the stable log having tails stored in the volatile memories to track operations on corresponding ones of the distributed counterparts, the distributed counterparts to corruption, a system for, and method of, restoring a distributed counterpart stored in one of the volatile memories. The system includes: (1) a checkpoint determination controller that determines which of the multiple checkpoints is a most recently completed checkpoint and copies the most recently completed checkpoint to the one of the volatile memories to serve as an unrevised database for reconstructing the distributed counterpart and (2) an operation application controller that retrieves selected ones of the operations from the stable log and a tail corresponding to the distributed counterpart and applies the operations to the unrevised database thereby to restore the distributed counterpart.

摘要翻译： 为了与与网络的服务器相关联的中央数据库使用，中央数据库具有存储在网络的客户端的易失性存储器中的分布的对等体，以允许在本地执行操作，中央数据库还具有多个检查点和稳定的日志存储 在服务器中用于在中央数据库上跟踪操作以允许对多个检查点进行相应的操作，稳定日志具有存储在易失性存储器中的尾部，以跟踪对应的分布对等体的操作，分布的对等体到腐败， 系统和恢复存储在一个易失性存储器中的分布式对方的方法。 该系统包括：（1）检查点确定控制器，其确定多个检查点中的哪一个是最近完成的检查点，并将最近完成的检查点复制到易失性存储器中的一个，以用作用于重建分布式对等体的未修复数据库， （2）操作应用程序控制器，其从稳定日志中检索所选择的操作和对应于分发对方的尾部，并将操作应用于未修改的数据库，从而恢复分布的对等体。

公开(公告)号：US08751618B2

公开(公告)日：2014-06-10

申请号：US13080661

申请日：2011-04-06

申请人： Rushi Prafull Bhatt ,  Rajeev Rastogi ,  Vineet Shashikant Chaoji ,  Sayan Ranu

发明人： Rushi Prafull Bhatt ,  Rajeev Rastogi ,  Vineet Shashikant Chaoji ,  Sayan Ranu

IPC分类号： G06F15/173

CPC分类号： G06Q50/01

摘要： A method, a system and a computer program product for maximizing content spread in a social network are provided. Samples of edges are generated from an initial candidate set of edges. Each edge of the samples of edges has a probability value for content flow. Further, a subset of edges is determined from the samples of edges based on gain corresponding to each edge. Also, each node of the subset of edges is having at least one of less than ‘K’ or equal to ‘K’ incoming edges. Further, the probability of each edge, of the subset of edges, may be incremented. Furthermore, a final set of edges may be determined by ensuring ‘K’ incoming edges. The ‘K’ incoming edges may be ensured by removing one or more incoming edges when a number of the incoming edges for a node of the final set is greater than ‘K’ incoming edge.

摘要翻译： 提供了一种用于最大化社交网络中的内容传播的方法，系统和计算机程序产品。 边缘样本从初始候选边缘集合生成。 边缘样本的每个边缘都具有内容流的概率值。 此外，基于与每个边缘相对应的增益，从边缘样本确定边缘子集。 此外，边缘子集的每个节点具有小于“K”或等于“K”个入口边缘中的至少一个。 此外，可以增加边缘子集中的每个边缘的概率。 此外，可以通过确保“K”进入边缘来确定最终的边缘集合。 当最终集合的节点的进入边缘的数量大于'K'的进入边缘时，可以通过去除一个或多个进入边缘来确保“K”个进入边缘。

公开(公告)号：US08620930B2

公开(公告)日：2013-12-31

申请号：US12721577

申请日：2010-03-11

申请人： Pankaj Gulhane ,  Srinivasan Hanumantha Rao Sengamedu ,  Ashwin Tengli ,  Rajeev Rastogi

发明人： Pankaj Gulhane ,  Srinivasan Hanumantha Rao Sengamedu ,  Ashwin Tengli ,  Rajeev Rastogi

IPC分类号： G06F7/00

CPC分类号： G06K9/3266 ,  G06K9/723 ,  G06K2209/01

摘要： A method includes generating, electronically, one or more matching patterns for one or more pairs of attribute values. Each pair includes two attribute values. The two attribute values include a first attribute value from a first record and a second attribute value from a second record. The first attribute value and the second attribute value satisfy a first criterion. Further, the method includes identifying, electronically, matching segment between the first attribute value and the second attribute value of a first pair. The method also includes repeating identifying for each pair. Moreover, the method includes computing a similarity score for the first pair using one of the first pair and the matching segment based on the one or more matching patterns and matching segments of the one or more pairs satisfying a second criterion. The method also includes repeating computing for each pair.

摘要翻译： 一种方法包括以电子方式生成一对或多对属性值的一个或多个匹配模式。 每对包含两个属性值。 两个属性值包括来自第一记录的第一属性值和来自第二记录的第二属性值。 第一属性值和第二属性值满足第一标准。 此外，该方法包括识别电子地匹配第一属性值与第一对的第二属性值之间的片段。 该方法还包括对每对重复识别。 此外，该方法包括基于一个或多个匹配模式和满足第二标准的一个或多个对中的匹配片段，使用第一对和匹配片段中的一个来计算第一对的相似性得分。 该方法还包括对每对重复计算。

公开(公告)号：US08224863B2

公开(公告)日：2012-07-17

申请号：US11025846

申请日：2004-12-29

申请人： Philip L. Bohannon ,  Wenfei Fan ,  Michael E. Flaster ,  Rajeev Rastogi

发明人： Philip L. Bohannon ,  Wenfei Fan ,  Michael E. Flaster ,  Rajeev Rastogi

IPC分类号： G06F17/30

CPC分类号： G06F17/30371 ,  G06F17/3051

摘要： Methods and apparatus are provided for identifying constraint violation repairs in data that is comprised of a plurality of records, where each record has a plurality of cells. A database is processed, based on a plurality of constraints that data in the database must satisfy. At least one constraint violation to be resolved is identified based on a cost of repair and the corresponding records to be resolved and equivalent cells are identified in the data that violate the identified at least one constraint violation. A value for each of the equivalent cells can optionally be determined, and the determined value can be assigned to each of the equivalent cells. The at least one constraint violation selected for resolution may be, for example, the constraint violation with a lowest cost. The cost of repairing a constraint is based on a distance metric between the attributes values.

摘要翻译： 提供了用于识别由多个记录组成的数据中的约束违规修复的方法和装置，其中每个记录具有多个单元。 基于数据库中的数据必须满足的多个约束来处理数据库。 基于修复成本和要解析的相应记录以及违反所识别的至少一个约束违规的数据中标识等价单元来识别要解决的至少一个约束违规。 可以可选地确定每个等效单元的值，并且可以将确定的值分配给每个等效单元。 选择用于解决的至少一个约束违反可以是例如具有最低成本的约束违反。 修复约束的成本基于属性值之间的距离度量。

公开(公告)号：US20120084636A1

公开(公告)日：2012-04-05

申请号：US12896942

申请日：2010-10-04

申请人： Srinivasan Hanumantha Rao SENGAMEDU ,  Charu Tiwari ,  Amit Madaan ,  Rupesh Rasiklal Mehta ,  S. R. Jeyashankher ,  Rajeev Rastogi

发明人： Srinivasan Hanumantha Rao SENGAMEDU ,  Charu Tiwari ,  Amit Madaan ,  Rupesh Rasiklal Mehta ,  S. R. Jeyashankher ,  Rajeev Rastogi

IPC分类号： G06F17/00

CPC分类号： G06F17/2282 ,  G06F17/2247 ,  G06F17/30864 ,  G06F17/30911

摘要： An example of a method includes determining features of a first type for a web page of a plurality of web pages. The method also includes electronically determining a plurality of rules for an attribute of the first web page, wherein the plurality of rules are determined based on features of the first type. The method also includes electronically identifying a first rule, from the plurality of rules, which satisfies a first predefined criterion. The first predefined criteria include at least one of a first threshold for a precision parameter, a second threshold for a support parameter, a third threshold for a distance parameter and a fourth threshold for a recall parameter. The method further includes storing the first rule to enable extraction of value of the attribute from a second web page.

摘要翻译： 一种方法的示例包括确定多个网页中的网页的第一类型的特征。 该方法还包括电子地确定用于第一网页的属性的多个规则，其中基于第一类型的特征来确定多个规则。 该方法还包括从满足第一预定准则的多个规则中电子地识别第一规则。 第一预定准则包括精度参数的第一阈值，支持参数的第二阈值，距离参数的第三阈值和召回参数的第四阈值中的至少一个。 该方法还包括存储第一规则以便能够从第二网页提取属性的值。

公开(公告)号：US20110167063A1

公开(公告)日：2011-07-07

申请号：US12652624

申请日：2010-01-05

申请人： Ashwin Tengli ,  Rajeev Rastogi ,  Jeyashankher Ramamirtham ,  Srinivasan H. Sengamedu ,  Sandeepkumar Bhuramal Satpal

发明人： Ashwin Tengli ,  Rajeev Rastogi ,  Jeyashankher Ramamirtham ,  Srinivasan H. Sengamedu ,  Sandeepkumar Bhuramal Satpal

IPC分类号： G06F17/30

CPC分类号： G06F7/00 ,  G06F17/30834 ,  G06F17/30864

摘要： Web pages are efficiently categorized in a data processor without analyzing the content of the web pages. According to at least one embodiment, data is maintained that represents sample URLs grouped into a plurality of clusters. The sample URLs of a cluster are used to produce a URL regular expression pattern (“URL-regex”) that differentiates the sample URLs of the cluster from the sample URLs of other clusters and that covers at least a specified percentage of the sample URLs in the cluster. The process of producing a URL-regex is repeated for each of the clusters producing a URL-regex for each cluster. Web pages are then categorized into one of the clusters by determining which of the URL-regex patterns produced for the clusters match URLs that refer to the web pages. Thus, a web page may be categorized based on a URL that refers to the web page without having to obtain and analyze the content of the web page.

摘要翻译： 在不分析网页内容的情况下，网页被有效地分类到数据处理器中。 根据至少一个实施例，维护表示分组为多个集群的抽样URL的数据。 集群的示例URL用于生成URL正则表达式模式（“URL-regex”），用于将集群的示例URL与其他集群的示例URL进行区分，并且至少包含指定百分比的示例URL 集群。 为每个集群重复生成URL-regex的过程，为每个集群生成一个URL-regex。 然后，通过确定针对集群产生的哪个URL-regex模式与引用网页的URL匹配，将网页分类到其中一个集群。 因此，可以基于引用网页的URL来分类网页，而不必获取和分析网页的内容。

公开(公告)号：US07907535B2

公开(公告)日：2011-03-15

申请号：US11944921

申请日：2007-11-26

申请人： Shipra Agrawal ,  K. V. M. Naidu ,  Rajeev Rastogi

发明人： Shipra Agrawal ,  K. V. M. Naidu ,  Rajeev Rastogi

IPC分类号： G01R31/08 ,  G06F153/173 ,  G06F11/00

CPC分类号： H04L41/0677 ,  H04L43/00 ,  H04L43/106 ,  H04L43/16

摘要： A system and method for determining optimal selection of paths for passively monitoring a communications network. A diagnostic set of paths is determined by ensuring that, for all pairs of links in the network, the set contains one path having only one member of that pair. A detection subset of paths is determined by ensuring that, for all the links in the network, one member of the subset contains that link. Selecting a minimum detection and diagnostic set of paths minimizes the communication overhead imposed by monitoring. During normal operation, only the detection subset need be monitored. Once an anomaly is detected, the system may switch to monitoring the full diagnostic set. The cost of deploying and operating the passive monitoring equipment is minimized by determining the minimum set of links on which a probe needs to be placed in order to monitor the diagnostic set of paths.

摘要翻译： 一种用于确定用于被动监视通信网络的路径的最佳选择的系统和方法。 通过确保对于网络中的所有链路对，该集合包含仅具有该对中的一个成员的路径来确定路径的诊断集。 通过确保对于网络中的所有链路，子集的一个成员包含该链路来确定路径的检测子集。 选择路径的最小检测和诊断集最小化通过监控施加的通信开销。 在正常操作期间，只需要监视检测子集。 一旦检测到异常，系统可能切换到监视完整的诊断集。 通过确定需要放置探头的最小链路集来监控路径的诊断集，可以最大限度地减少部署和操作被动监控设备的成本。