Study on Optimization for Constraint Query Processing and Framework for Constraint Databases

约束查询处理优化及约束数据库框架研究

基本信息

  • 批准号:
    17500097
  • 负责人:
  • 金额:
    $ 1.73万
  • 依托单位:
  • 依托单位国家:
    日本
  • 项目类别:
    Grant-in-Aid for Scientific Research (C)
  • 财政年份:
    2005
  • 资助国家:
    日本
  • 起止时间:
    2005 至 2007
  • 项目状态:
    已结题

项目摘要

A central research theme for constraint query processing includes a study on methods for solving constraint satisfaction problems in constraint databases. At the start of this study, we investigated many frameworks related to the processing of constraint databases. In order to proceed effectively, we focused on the following constraints : character sequence, network structure, spatial data, computational geometry, and finite domain. The fruitful productions of the study are below :(1) Character Sequence ConstraintsIn order to solve the character sequence constraints that are represented as extracting frequent subsequences from databases storing character or word sequences, we focused on molecular sequence databases and revealed methods for extracting frequent sequential patterns with a regular expression that has a capability to represent variable wildcard regions and ambiguous characters. Moreover, we revealed a dynamic load-balancing technique on distributed parallel processing to sp … More eed up the processing of frequent variable pattern extraction.(2) Network Structure ConstraintsTo solve the network structure constraints that are represented as understanding databases with a network relationship, we revealed a method for decomposing the network relation of a Blog user space using a clustering technique. Sub-networks extracted by the decomposition denote Blog user communities.(3) Spatial Data ConstraintsTo solve special data constraints included in constraint databases that store special information, we focused on logs of Web services that are accessed from cellular phones tracked by GPS, and revealed a method to speed up the extraction of frequent neighboring attribute patterns from constraint databases that store spatial objects located in two-dimensional space.(4) Computational Geometry ConstraintsTo solve computational geometry constraints, we focused on a reconciliation graph that is constructed by connecting the leaf layers of two ordered heterogeneous trees, i.e., genetic and taxonomic trees. As a result, we revealed a method that drastically reduces the number of crossovers on a reconciliation graph.(5) Finite Domain ConstraintsTo solve finite domain constraints defined over finite sets, we focused on a job-shop scheduling problem that is defined by n jobs J_1, J_2, ., J_n of varying sizes, which need to be scheduled on m identical machines, while trying to minimize the total length of the schedule. As a result, we revealed a method to speed up the computation of a constraint solver in PC cluster environments. Less
约束查询处理的中心研究主题包括研究解决约束数据库中的约束满足问题的方法。在本研究开始时,我们研究了许多与约束数据库处理相关的框架。为了有效地进行,我们关注以下约束:字符序列、网络结构、空间数据、计算几何和有限域。本研究的成果如下:(1)字符序列约束为了解决从存储字符或单词序列的数据库中提取频繁子序列的字符序列约束,我们重点关注分子序列数据库,并揭示了使用能够表示可变通配符区域和模糊字符的正则表达式提取频繁序列模式的方法。此外,我们揭示了一种分布式并行处理的动态负载平衡技术,以加速频繁变量模式提取的处理。(2)网络结构约束为了解决表示为具有网络关系的理解数据库的网络结构约束,我们揭示了一种使用聚类技术分解博客用户空间的网络关系的方法。分解提取的子网络表示博客用户社区。(3)空间数据约束为了解决存储特殊信息的约束数据库中包含的特殊数据约束,我们重点关注通过GPS跟踪的手机访问的Web服务日志,并提出了一种加速从存储二维空间对象的约束数据库中提取频繁相邻属性模式的方法。 (4)计算几何约束为了解决计算几何约束,我们重点关注通过连接两个有序异构树(即遗传树和分类树)的叶层构建的协调图。结果,我们揭示了一种大大减少调和图上交叉数量的方法。(5)有限域约束为了解决有限集上定义的有限域约束,我们关注由n个不同大小的作业J_1,J_2,.,J_n定义的作业车间调度问题,这些作业需要在m台相同的机器上调度,同时尝试最小化总数 时间表的长度。因此,我们揭示了一种在 PC 集群环境中加速约束求解器计算的方法。较少的

项目成果

期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)
Extremal Optimizationによる調停グラフの交差数減少
使用极限优化减少仲裁图中的交集数量
グリッド環境下での分散型ワーカモデルを用いたModified PrefixSpan法の動的負荷分散方式
网格环境下分布式Worker模型的Modified PrefixSpan法动态负载均衡方法
Extraction of Least Minimum Generalization from Mismatch Cluster
从不匹配簇中提取最小泛化
  • DOI:
  • 发表时间:
    2007
  • 期刊:
  • 影响因子:
    0
  • 作者:
    Kotaro;Araki;Keiichi;Tamura;Tomoyuki;Kato;Hajime;Kitakami
  • 通讯作者:
    Kitakami
Extraction Method of Frequent Communities from Blog data Sets
博客数据集中频繁社区的提取方法
  • DOI:
  • 发表时间:
    2007
  • 期刊:
  • 影响因子:
    0
  • 作者:
    Makoto;Takaki;Yasuma;Mori;Keiichi;Tamura;Susumu;Kuroki;Hajime;Kitakami
  • 通讯作者:
    Kitakami
遺伝的プログラミングによる調停グラフ交差数減少のための並列分散処理
使用遗传编程的并行分布式处理减少仲裁图交集的数量
{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ monograph.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ sciAawards.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ conferencePapers.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ patent.updateTime }}

KITAKAMI HAJIME其他文献

KITAKAMI HAJIME的其他文献

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}
{{ showInfoDetail.title }}

作者:{{ showInfoDetail.author }}

知道了