2007 Fiscal Year Final Research Report Summary
Study on Optimization for Constraint Query Processing and Framework for Constraint Databases
| Project/Area Number |
17500097
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Intelligent informatics
|
|---|
| Research Institution | Hiroshima City University |
|---|
Principal Investigator |
KITAKAMI HAJIME Hiroshima City University, Graduate School of Information Sciences, Professor (50234240)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
KUROKI SUSUMU Hiroshima City University, Information Sciences, Associative Professor (20225288)
MORI YASUMA Hiroshima City University, Information Sciences, Assistant Professor (60264959)
TAMURA KEIICHI Hiroshima City University, Information Sciences, Assistant Professor (80347616)
|
|---|
| Project Period (FY) |
2005 – 2007
|
| Keywords | Data Mining / Variable Wildcard Region / Mismatch Cluster / Distributed Parallel Processing / Gibbs Sampler / Suffix Tree / Sequence Database / Blog User Space |
|---|
| Research Abstract |
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 Constraints
In 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 Constraints
To 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 Constraints
To 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 Constraints
To 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 Constraints
To 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
|
Research Products
(37 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Extraction of Ambiguous Sequential Patterns with Least Minimum Generalization from Mismatch Clusters2007
Author(s)
Kotaro. Araki, Kiichi. Tamura, Tomoaki, Kato, Yasuma, Mori, Hajime, Kitakami
Organizer
Proceedings of The Third International Conference on Signal-Image Technology & Internet-Base system, Track Information Management & Retrieval Technologies(IMRT), IEEE omputer Society Press
Place of Presentation
Jiangong Jinjiang Hotel, Shanghai, China
Year and Date
20071216-19
Description
「研究成果報告書概要(欧文)」より
-
-
-
-
[Presentation] Method for Extracting Frequent Communities from Blog User Spaces2007
Author(s)
Makoto, Takaki, Yasuma, Mori, Keiichi, Tamura, Susumu, Kuroki, Hajime, Kitakami
Organizer
The 2007 International Conference on Parallel & Distributed Processing Techniques & Applications(PDPTA'07)
Place of Presentation
Monte Carlo Hotel, Las Vegas, Nevada in USA
Year and Date
20070625-28
Description
「研究成果報告書概要(欧文)」より
-
-
-
-
[Presentation] Extraction for Frequent Sequential Patterns with Minimum Variable-Wildcard Regions2006
Author(s)
Tomoyuki, Kato, Hajime, Kitakami, Makoto, Takaki, Keiichi, Tamura, Yasuma, Mori, Susumu, Kuroki
Organizer
Proceedings of The 2006 Internationr Conference on Parallel and Distribute Processing Techniques and Application(PDPTA'06 & RTCOMP'06)
Place of Presentation
Monte Carlo Hotel, Las Vegae. Nevada in USA
Year and Date
20060626-30
Description
「研究成果報告書概要(欧文)」より
-
-
[Presentation] The Minimum Generalization of Flexible Sequence Patterns Extracted by Prefix-Projected Pattern-Growth Approach2005
Author(s)
Hajime, Kitakami, Makoto, Takaki, Keiichi, Tamura, Tomoaki, Kato, Susumu, Kuroki
Organizer
The 3rd RECOMB Comparative Genomic Satellite Workshop, Poster Session
Place of Presentation
Trinity College Dublin in Ireland
Year and Date
20050918-20
Description
「研究成果報告書概要(欧文)」より
-
-
[Presentation] New Dynamic Load Balancing Technique for Parallel Modified PrefixSpan with Distributed Worker Paradigm and Its Performance Evaluation2005
Author(s)
Makoto, Takaki, Keiichi, Tamura, Toshihide, Sutou, Hajime, Kitakami
Organizer
Proceedings of the Sixth International Symposium on High Performance Computing(ISHPC-VI) Published in 2008, Lecture Notes in Computer Science(LNCS), Springer-Verlag
Place of Presentation
Nara New Public Hall, Nara city, Japan
Year and Date
20050907-09
Description
「研究成果報告書概要(欧文)」より
-
-
[Presentation] Efficiently Mining Sequence Patterns With Variable-Length Wildcard Regions Using An Extended Modified PrefixSpan Method2005
Author(s)
Shigetaka, Tono, Hajime, Kitakami, Keiichi, Tamura, Yasuma, MORI, Susumu, Kuroki
Organizer
The 13th Annual International Conference on Intelligent Systems for Molecular Biology(ISMB2005)
Place of Presentation
Renaissance Center Marriott, Detroit, Michigan in USA
Year and Date
20050625-29
Description
「研究成果報告書概要(欧文)」より
-
-
[Presentation] Extraction of Ambiguous Sequential Patterns with Least Minimum Generalization from Mismatch Clusters2005
Author(s)
Makoto, Takaki, Keiichi, Tamura, Toshihide, Sutou, Hajime, Kitakami
Organizer
New Dynamic Load Balancing for Parallel Modified PrefixSpan with Distributed Worker Paradigm, Proc. of International Special Workshop on Databases for Next Generation Researchers in Memoriam of Prof. Kambayashi(SWOD2005), also to be appeared in Proceedings of ICDE Workshops, IEEE Computer Society
Place of Presentation
National Center of Science, Tokyo, Japan
Year and Date
2005-04-04
Description
「研究成果報告書概要(欧文)」より
-
