会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Filter Range Bound Paged Search
    • 过滤范围绑定搜索
    • US20100318541A1
    • 2010-12-16
    • US12484435
    • 2009-06-15
    • Yogesh Vilas GolwalkarKristin Marie HazlewoodMagesh Rajamani
    • Yogesh Vilas GolwalkarKristin Marie HazlewoodMagesh Rajamani
    • G06F17/30
    • G06F17/30389H04L61/1517H04L61/1523
    • A filter range based search control to request a range of data from one or more directory servers. A directory server receives a search request from a client application comprising a search filter control defining a set of requested data, a sort control defining a sorting order of the set of requested data, and a range filter control defining a range of entries in the requested data. Data entries matching a search value defined in the search filter control and sorted according to sort attributes defined in the sort control are obtained from a set of directories associated with the directory server to form a sorted list of matching entries. A subset of data entries in the sorted list that match a range value defined in the range filter control are collected, and a response comprising the collected subset of data entries is then sent to the client application.
    • 基于过滤器范围的搜索控制,以从一个或多个目录服务器请求一系列数据。 目录服务器从包括定义一组请求数据的搜索过滤器控件的客户端应用程序接收搜索请求,定义所请求数据集合的排序顺序的分类控件以及定义所请求数据中的条目范围的范围过滤器控件 数据。 从与目录服务器相关联的一组目录获得与搜索过滤器控件中定义的搜索值匹配并根据排序控件中定义的排序属性进行排序的数据条目,以形成匹配条目的排序列表。 收集排序列表中与范围过滤器控件中定义的范围值匹配的数据条目的子集,然后将包含所收集的数据条目子集的响应发送到客户端应用程序。
    • 4. 发明申请
    • NETWORK DIRECTORY ACCESS MECHANISM
    • 网络目录访问机制
    • US20010011277A1
    • 2001-08-02
    • US09033870
    • 1998-03-03
    • JEAN-CHRISTOPHE MARTINSYLVAIN DULOUTRE
    • G06F017/00
    • H04L61/1523H04L61/1517Y10S707/99931Y10S707/99933Y10S707/99939
    • A computer-implemented directory access mechanism provides a directory service operable to access a network directory under a predetermined protocol by responding to an access request under the protocol for information available in a predetermined environment external to the directory. The directory service then uses the access method for the environment to access the information available in the environment. In this manner, data in the given environment can be accessed by a directory service operable under the given protocol by configuring an attribute access method and using this method to retrieve the information. The protocol can be the Lightweight Directory Access Protocol. The information to be accessed could typically be an attribute of an entry in the directory. An access control list (for example the Directory Access Control Domain) can contain not only control access rights for directory objects, but also the access methods for attributes of the directory objects.
    • 计算机实现的目录访问机制提供目录服务,其可操作以通过响应于协议下的访问请求在预定协议下访问网络目录,以获得在目录外部的预定环境中可用的信息。 然后,目录服务使用环境的访问方法来访问环境中可用的信息。 以这种方式,给定环境中的数据可以由在给定协议下操作的目录服务来访问,通过配置属性访问方法并使用该方法来检索信息。 该协议可以是轻量级目录访问协议。 要访问的信息通常可以是目录中条目的属性。 访问控制列表(例如目录访问控制域)不仅可以包含目录对象的控制访问权限,还可以包含目录对象属性的访问方法。
    • 6. 发明授权
    • X.500 system and methods
    • X.500系统和方法
    • US6052681A
    • 2000-04-18
    • US793575
    • 1997-05-22
    • Richard Hans Harvey
    • Richard Hans Harvey
    • G06F12/00G06F7/00G06F17/30H04L29/12
    • G06F17/30595G06F17/30604G06F17/30607H04L29/12132H04L61/1517H04L61/1552H04L29/12075H04L29/12084H04L61/1523Y10S707/99931Y10S707/99933Y10S707/99934Y10S707/99942Y10S707/99954
    • The present invention addresses the problem of implementing X.500 using an SQL product. The present application discloses an application of X.500 to a relational database, a database design and use of the database to perform X.500 services. Particularly, the disclosure relates to implementation using an RDBMS (Relational DataBase Management System). One invention disclosed resides around service modelling, the processing of arbitrary data using a fixed set of queries/services. Another invention resides in the implementation of a disk based model using relational queries to satisfy X.500 services and enables benefits of RDBMS to be exploited. Further, the invention provides an SQL based X.500 application that can perform at subsecond speed and is relatively unaffected by the size of database, DIT shape, type of data or complexity of service, including aliases.
    • PCT No.PCT / AU95 / 00560 Sec。 371日期:1997年5月22日 102(e)日期1997年5月22日PCT提交1995年8月30日PCT公布。 公开号WO96 / 07147 日期1996年3月7日本发明解决了使用SQL产品实现X.500的问题。 本申请公开了将X.500应用于关系数据库,数据库设计和使用数据库执行X.500服务。 特别地,本公开涉及使用RDBMS(关系数据库管理系统)的实现。 所公开的一个发明涉及服务建模,使用固定的查询/服务集来处理任意数据。 另一个发明在于使用关系查询来实现基于磁盘的模型以满足X.500服务并且利用RDBMS的优点。 此外,本发明提供了一种基于SQL的X.500应用程序,其可以以亚秒速度执行,并且相对不受数据库大小,DIT形状,数据类型或服务复杂度(包括别名)的影响)。
    • 10. 发明授权
    • Method for using query templates in directory caches
    • 在目录缓存中使用查询模板的方法
    • US07523091B2
    • 2009-04-21
    • US11108940
    • 2005-04-19
    • Olga KapitskaiaRaymond NgDivesh Srivastava
    • Olga KapitskaiaRaymond NgDivesh Srivastava
    • G06F17/30
    • G06F17/30457G06F17/3048H04L29/06H04L61/1517H04L61/1523H04L67/2852H04L67/289Y10S707/99931Y10S707/99932Y10S707/99933Y10S707/99935Y10S707/99939Y10S707/99953
    • The present invention discloses the use of generalized queries, referred to as query templates, obtained by generalizing individual user queries, as the semantic basis for low overhead, high benefit directory caches for handling declarative queries. Caching effectiveness can be improved by maintaining a set of generalizations of queries and admitting such generalizations into the cache when their estimated benefits are sufficiently high. In a preferred embodiment of the invention, the admission of query templates into the cache can be done in what is referred to by the inventors as a “revolutionary” fashion—followed by stable periods where cache admission and replacement can be done incrementally in an evolutionary fashion. The present invention can lead to considerably higher hit rates and lower server-side execution and communication costs than conventional caching of directory queries—while keeping the clientside computational overheads comparable to query caching.
    • 本发明公开了通过将各个用户查询概括化而获得的通用查询(称为查询模板)作为用于处理声明式查询的低开销,高效益目录高速缓存的语义基础。 可以通过维护一组查询的概括来将高速缓存的有效性提高,并且当它们的估计收益足够高时,将这种泛化允许缓存。 在本发明的优选实施例中,将查询模板准许到高速缓存中可以在本发明人被称为“革命性”方式的情况下完成 - 其次是稳定的时期,其中缓存允许和替换可以在进化中逐步地完成 时尚。 与传统的目录查询缓存相比,本发明可以导致相当高的命中率和较低的服务器端执行和通信成本,同时保持客户端计算开销与查询缓存相当。