公开(公告)号：US07194271B2

公开(公告)日：2007-03-20

申请号：US10821893

申请日：2004-04-12

申请人： S. Jamaloddin Golestani ,  Rajeev Rastogi ,  Mark Anthony Smith

发明人： S. Jamaloddin Golestani ,  Rajeev Rastogi ,  Mark Anthony Smith

IPC分类号： H04Q7/20

CPC分类号： H04W72/082 ,  H04W84/12

摘要： Channels are allocated to one or more cells within a wireless LAN (WLAN) without causing unacceptable interference. The allocation involves dividing an allocation time period into frames, each frame having a substantially short duration, and then allocating one or more channels to one or more WLAN cells during each such frame according to an allocation vector. The vector assures that each cell allocated a channel is sufficiently distant from every other cell allocated the same channel to minimize cross interference. Only those cells allocated a channel are allowed to transmit during a given frame. The allocation vectors are determined in such a way that the performance of a WLAN is optimized.

摘要翻译： 信道被分配给无线局域网（WLAN）内的一个或多个小区，而不引起不可接受的干扰。 分配包括将分配时间段划分为帧，每帧具有基本上短的持续时间，然后根据分配向量在每个这样的帧期间将一个或多个信道分配给一个或多个WLAN小区。 向量确保分配信道的每个小区与分配相同信道的每个其他小区足够远，以最小化交叉干扰。 在给定帧期间，只允许分配信道的信元进行发送。 确定分配向量，使得WLAN的性能被优化。

公开(公告)号：US20060212860A1

公开(公告)日：2006-09-21

申请号：US10955322

申请日：2004-09-30

申请人： Michael Benedikt ,  Minos Garofalakis ,  Rajeev Rastogi

发明人： Michael Benedikt ,  Minos Garofalakis ,  Rajeev Rastogi

IPC分类号： G06F9/45

CPC分类号： G06F17/2247 ,  G06F17/227 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99936 ,  Y10S707/99937 ,  Y10S707/99942

摘要： Method for performing information-preserving DTD schema embeddings between a source schema when matching a source schema and a target schema. The preservation is realized by a matching process between the two schemas that finds a first string marking of the target schema, evaluates a legality of the first string marking, determines an estimated mimimal cost of the first string marking and subsequently adjusts the estimated minimal cost based upon one to one mapping of source schema and target schema subcomponents.

摘要翻译： 在匹配源模式和目标模式时，在源模式之间执行信息保留DTD模式嵌入的方法。 通过找到目标模式的第一个字符串标记的两个模式之间的匹配过程来实现保存，评估第一个字符串标记的合法性，确定第一个字符串标记的估计的模拟成本，然后调整估计的最小成本 在源模式和目标模式子组件的一对一映射。

公开(公告)号：US20060161566A1

公开(公告)日：2006-07-20

申请号：US11025211

申请日：2004-12-29

申请人： Alin Dobra ,  Johannes Gehrke ,  Rajeev Rastogi ,  Minos Garofalakis

发明人： Alin Dobra ,  Johannes Gehrke ,  Rajeev Rastogi ,  Minos Garofalakis

IPC分类号： G06F7/00

CPC分类号： G06F17/30516 ,  G06F17/3046 ,  Y10S707/99936 ,  Y10S707/99942

摘要： A method of efficiently providing estimated answers to workloads of aggregate, multi-join SQL-like queries over a number of input data-streams. The method only examines each data elements once and uses a limited amount of computer memory. The method uses join graphs and atomic sketches that are essentially pseudo-random summaries formed using random binary variables. The estimated answer is the product of all the atomic sketches for all the vertices in the query join graph. A query workload is processed efficiently by identifying and sharing atomic sketches common to distinct queries, while ensuring that the join graphs remain well formed. The method may automatically minimize either the average query error or the maximum query error over the workload.

摘要翻译： 一种有效提供对多个输入数据流的聚合，多连接SQL类查询的工作负载的估计答案的方法。 该方法仅检查每个数据元素一次并使用有限数量的计算机存储器。 该方法使用连接图和原子素描，它们本质上是使用随机二进制变量形成的伪随机摘要。 估计答案是查询连接图中所有顶点的所有原子草图的乘积。 通过识别和共享不同查询共同的原子草图，同时确保连接图形式保持良好，可以有效地处理查询工作负载。 该方法可以自动最小化平均查询错误或工作负载上的最大查询错误。

公开(公告)号：US20060155743A1

公开(公告)日：2006-07-13

申请号：US11025846

申请日：2004-12-29

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

发明人： Philip Bohannon ,  Wenfei Fan ,  Michael 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.

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

公开(公告)号：US20060067267A1

公开(公告)日：2006-03-30

申请号：US10953356

申请日：2004-09-30

申请人： S. Golestani ,  Rajeev Rastogi ,  Mark Smith

发明人： S. Golestani ,  Rajeev Rastogi ,  Mark Smith

IPC分类号： H04Q7/00

CPC分类号： H04W16/10 ,  H04W16/14 ,  H04W28/16 ,  H04W28/26 ,  H04W84/12

摘要： Channels are allocated to access points (APs) within a wireless, local area network (WLAN) in a reasonable time period using approximation methods. One approximation method guarantees channel allocations will be no less than ⅙ of an optimal channel allocation scheme provided the interference pattern associated with APs within a given WLAN conform to a unit disk graph interference pattern.

摘要翻译： 在合理的时间段内，使用近似方法将信道分配给无线局域网（WLAN）内的接入点（AP）。 如果与给定WLAN内的AP相关联的干扰模式符合单位磁盘图干扰模式，则一种近似方法保证信道分配不得小于最优信道分配方案的1/6。

公开(公告)号：US20050278368A1

公开(公告)日：2005-12-15

申请号：US11095344

申请日：2005-03-31

申请人： Michael Benedikt ,  Wenfei Fan ,  Rajeev Rastogi

发明人： Michael Benedikt ,  Wenfei Fan ,  Rajeev Rastogi

IPC分类号： G06F17/22 ,  G06F17/30

CPC分类号： G06F17/227 ,  G06F16/84

摘要： A framework is provided for integrating data from multiple relational sources into an XML document that both conforms to a given DTD and satisfies predefined XML constraints. The framework is based on a specification language, designated Attribute Integration Grammar (AIG), that extends a DTD by (1) associating element types with semantic attributes, (2) computing these attributes via parameterized SQL queries over multiple data sources, and (3) incorporating XML keys and inclusion constraints. The AIG uniquely operates on semantic attributes and their dependency relations for controlling context-dependent, DTD-directed construction of XML documents, and, as well as checks XML constraints in parallel with document-generation.

摘要翻译： 提供了一个框架，用于将来自多个关系源的数据集成到符合给定DTD并满足预定义XML约束的XML文档中。 该框架基于指定语言，指定的属性集成语法（AIG），其通过（1）将元素类型与语义属性相关联来扩展DTD，（2）通过多个数据源通过参数化SQL查询计算这些属性，以及（3 ）结合XML密钥和包含约束。 AIG独特地操作语义属性及其依赖关系，用于控制与文档相关的依赖于DTD的XML文档的构建，以及与文档生成并行检查XML约束。

公开(公告)号：US20050226191A1

公开(公告)日：2005-10-13

申请号：US10821893

申请日：2004-04-12

申请人： S. Golestani ,  Rajeev Rastogi ,  Mark Smith

发明人： S. Golestani ,  Rajeev Rastogi ,  Mark Smith

IPC分类号： H04B1/713 ,  H04L12/28 ,  H04W72/08 ,  H04W84/12 ,  H04Q7/24

CPC分类号： H04W72/082 ,  H04W84/12

摘要： Channels are allocated to one or more cells within a wireless LAN (WLAN) without causing unacceptable interference. The allocation involves dividing an allocation time period into frames, each frame having a substantially short duration, and then allocating one or more channels to one or more WLAN cells during each such frame according to an allocation vector. The vector assures that each cell allocated a channel is sufficiently distant from every other cell allocated the same channel to minimize cross interference. Only those cells allocated a channel are allowed to transmit during a given frame. The allocation vectors are determined in such a way that the performance of a WLAN is optimized.

摘要翻译： 信道被分配给无线局域网（WLAN）内的一个或多个小区，而不引起不可接受的干扰。 分配包括将分配时间段划分为帧，每帧具有基本上短的持续时间，然后根据分配向量在每个这样的帧期间将一个或多个信道分配给一个或多个WLAN小区。 向量确保分配信道的每个小区与分配相同信道的每个其他小区足够远，以最小化交叉干扰。 在给定帧期间，只允许分配信道的信元进行发送。 确定分配向量，使得WLAN的性能被优化。

公开(公告)号：US20050021686A1

公开(公告)日：2005-01-27

申请号：US10600995

申请日：2003-06-20

申请人： Ben Jai ,  Gokul Prabhakar ,  Rajeev Rastogi

发明人： Ben Jai ,  Gokul Prabhakar ,  Rajeev Rastogi

IPC分类号： G06F15/177 ,  H04L12/24

CPC分类号： H04L41/0886 ,  H04L41/0213 ,  H04L41/0866

摘要： A number of configuration elements are associated with a number of devices. Information about input configuration elements is accessed. An input configuration element is associated with one or more input rules. It is determined which of the configuration elements could be accessed by the input rules and any call chains emanating from the rules. Output rules are determined by using the accessed configuration elements, the input rules, and the way the input rule manipulates its accessed configuration elements. Each output rule may be derived from an input rule and corresponds to the same input configuration element associated with that input rule. An executable module is generated that is adapted to access at least a given one of the input configuration elements and to trigger one or more of the output rules corresponding to the given input configuration element. Read and write sets for rules are determined, and the triggered output rules ensure that restrictions associated with a configuration element are not violated

摘要翻译： 许多配置元素与多个设备相关联。 访问有关输入配置元素的信息。 输入配置元素与一个或多个输入规则相关联。 确定哪些配置元素可以被输入规则和从规则发出的任何调用链访问。 输出规则通过使用访问的配置元素，输入规则以及输入规则操纵其访问的配置元素的方式来确定。 每个输出规则可以从输入规则导出，并且对应于与该输入规则相关联的相同输入配置元素。 生成可执行模块，其适于访问至少一个给定的一个输入配置元素，并且触发对应于给定输入配置元素的一个或多个输出规则。 确定规则的读取和写入集合，并且触发的输出规则确保与配置元素相关联的限制不被违反

公开(公告)号：US06697338B1

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

申请号：US09428419

申请日：1999-10-28

申请人： Yuri Breitbart ,  Minos N. Garofalakis ,  Clifford Eric Martin ,  Rajeev Rastogi ,  Srinivasan Seshadri ,  Abraham Silberschatz

发明人： Yuri Breitbart ,  Minos N. Garofalakis ,  Clifford Eric Martin ,  Rajeev Rastogi ,  Srinivasan Seshadri ,  Abraham Silberschatz

IPC分类号： H04L1228

CPC分类号： H04L41/12

摘要： Physical connectivity is determined between elements such as switches and routers in a multiple subnet communication network. Each element has one or more interfaces each of which is physically linked with an interface of another network element. Address sets are generated for each interface of the network elements, wherein members of a given address set correspond to network elements that can be reached from the corresponding interface for which the given address set was generated. The members of first address sets generated for corresponding interfaces of a given network element, are compared with the members of second address sets generated for corresponding interfaces of network elements other than the given element. A set of candidate connections between an interface of the given network element and one or more interfaces of other network elements, are determined. If more than one candidate connection is determined, connections with network elements that are in the same subnet as the given network element are eliminated from the set.

摘要翻译： 在多个子网通信网络中的诸如交换机和路由器的元件之间确定物理连接性。 每个元件具有一个或多个接口，每个接口与另一个网络元件的接口物理连接。 为网络元件的每个接口生成地址集，其中给定地址集合的成员对应于可以从生成给定地址集的相应接口到达的网络元素。 将给定网元的相应接口生成的第一地址集的成员与为给定元素以外的网元的相应接口生成的第二地址集的成员进行比较。 确定给定网络元件的接口与其他网络元件的一个或多个接口之间的一组候选连接。 如果确定了多个候选连接，则与组中与网络元素位于与给定网络元素相同的子网中的连接被消除。

公开(公告)号：US06449623B1

公开(公告)日：2002-09-10

申请号：US09207927

申请日：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分类号： G06F1200

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 logging information about reads of a database in memory to detect errors in data of the database, wherein said errors in data of said database arise from one of bad writes of data to the database, of erroneous input of data to the database by users and of logical errors in code of a transaction. The read logging method may be implemented in a plurality of database recovery models including a cache-recovery model, a prior state model a redo-transaction model and a delete transaction model. In the delete transaction model, it is assumed that logical information is not available to allow a redo of transactions after a possible error and the effects of transactions that read corrupted data are deleted from history and any data written by a transaction reading Ararat data is treated as corrupted.

摘要翻译： 从数据库的数据损坏中检测和恢复的方法的特征在于记录关于数据库在存储器中的读取的信息的步骤，以检测数据库的数据中的错误，其中所述数据库的数据中的错误来自坏写入之一 的数据，数据由用户错误地输入到数据库以及事务代码中的逻辑错误。 读取记录方法可以在包括高速缓存恢复模型，先前状态模型，重做事务模型和删除事务模型的多个数据库恢复模型中实现。 在删除事务模型中，假设逻辑信息不可用于允许在可能的错误之后重做事务，并且从历史中删除读取损坏的数据的事务的影响，并且处理由读取Ararat数据的事务写入的任何数据被处理 被破坏。