会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Database processing using schemas
    • 使用模式进行数据库处理
    • US6052686A
    • 2000-04-18
    • US933197
    • 1997-09-18
    • Maria F. FernandezDan Suciu
    • Maria F. FernandezDan Suciu
    • G06F17/30
    • G06F17/30607G06F17/30294G06F17/30421G06F17/30504G06F17/30864Y10S707/959Y10S707/99933
    • An apparatus and method for efficiently processing a database. A structure of the database is constructed into a schema which only includes those structures of the database that are known. Desired information to be extracted from the database is specified using path expressions and an automaton models the path expression. A composite automaton is generated based on the automaton and the schema. The composite automaton is pruned and portions of the database corresponding to the pruned automaton is searched to obtain the desired information. Points within the database may be identified to begin searching for the desired information. These points correspond to states of the composite automaton. A hybrid automaton may be formed for each set of possible starting states to determine completeness by simulating the hybrid automaton against the composite automaton.
    • 一种用于有效处理数据库的装置和方法。 数据库的结构被构造为仅包括已知数据库的那些结构的模式。 使用路径表达式指定要从数据库中提取的所需信息,并使用自动机对路径表达式建模。 基于自动机和模式生成复合自动机。 修剪复合自动机,并搜索与修剪的自动机对应的数据库部分,以获得所需的信息。 可以识别数据库内的点以开始搜索期望的信息。 这些点对应于复合自动机的状态。 可以为每组可能的起始状态形成混合自动机,以通过模拟针对复合自动机的混合自动机来确定完整性。
    • 6. 发明授权
    • View maintenance for unstructured databases
    • 查看非结构化数据库的维护
    • US5999926A
    • 1999-12-07
    • US910010
    • 1997-08-12
    • Dan Suciu
    • Dan Suciu
    • G06F17/30
    • G06F17/30483Y10S707/99931Y10S707/99932Y10S707/99934Y10S707/99935Y10S707/99952
    • A method and apparatus provides for efficient view maintenance of query of a database. The database is represented by an edge-labeled tree which is decomposed into a plurality of portions based on an automaton modeling an original query. When an addition to the database occurs, it is first determined which portion of the database the addition is made. Then an update query is performed on the added portion. The update query is determined by selecting a state corresponding to a portion as a root state and ignoring all previous states and transitions. The update query is applied to the portion of the database that the addition is made. The result of the update query is incorporated with the results of the query to produce an updated view.
    • 方法和装置提供对数据库的查询的有效视图维护。 数据库由边缘标记的树表示,其根据对原始查询建模的自动机将其分解成多个部分。 当发生数据库的添加时,首先确定添加数据库的哪个部分。 然后对添加的部分执行更新查询。 通过选择与部分相对应的状态作为根状态并忽略所有先前的状态和转换来确定更新查询。 更新查询应用于数据库的添加部分。 更新查询的结果与查询的结果相结合,以生成更新的视图。
    • 10. 发明授权
    • Queries on distributed unstructured databases
    • 关于分布式非结构化数据库的查询
    • US5987449A
    • 1999-11-16
    • US905804
    • 1997-08-12
    • Dan Suciu
    • Dan Suciu
    • G06F17/30
    • G06F17/30545Y10S707/99932Y10S707/99933Y10S707/99934
    • A method and apparatus for applying a query to a database that is distributed into first portions. The query is first partially performed by terminals each containing one of the first portions. The results of the partial queries are recombined in such a way as to minimize the traffic among the terminals connected across networks. Paths of an edge-labeled tree representing the database connecting the first portions are expanded into subpaths corresponding to all the states of an automaton modeling the query. The database is distributed into second portions based on the automaton. Non-existing subpaths are ignored based on the automaton and which of the second portions the paths exit. Thus, the data transferred among first portions are minimized and the query process is optimized.
    • 一种将查询应用于分布在第一部分中的数据库的方法和装置。 该查询首先由包含第一部分之一的终端部分执行。 部分查询的结果以使得跨网络连接的终端之间的流量最小化的方式进行重组。 表示连接第一部分的数据库的边缘标记树的路径被扩展为对应于建模查询的自动机的所有状态的子路径。 基于自动机将数据库分配到第二部分。 基于自动机将忽略不存在的子路径,以及哪些第二部分路径退出。 因此,在第一部分之间传送的数据被最小化并且查询处理被优化。