An Efficient Algorithm for Generating Maximal Interval Groups in Interval Databases
| dc.contributor.author | Arman, Nabil | |
| dc.date.accessioned | 2017-01-19T11:03:47Z | |
| dc.date.accessioned | 2022-05-22T08:26:26Z | |
| dc.date.available | 2017-01-19T11:03:47Z | |
| dc.date.available | 2022-05-22T08:26:26Z | |
| dc.date.issued | 2004 | |
| dc.description.abstract | The development of efficient algorithms to enumerate all intervals that have certain properties has attracted a large amount of research efforts due to the important role of interval-based reasoning in different areas like rule-based systems, including Expert Systems (ESs), Information Distribution Systems (IDSs), and database systems to name a few. These algorithms are very crucial to answer certain queries about these intervals. This paper presents an efficient algorithm to generate all maximal interval groups form a given interval set. | en_US |
| dc.identifier.issn | 16052587 | |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/7725 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Maximal interval groups; interval database. | en_US |
| dc.title | An Efficient Algorithm for Generating Maximal Interval Groups in Interval Databases | en_US |
| dc.type | Article | en_US |