Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | en_US |
| dc.creator | Luk, Ming-hay | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/6196 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Decision support queries on graph data : answering which-pair queries | en_US |
| dcterms.abstract | Decision support systems are computer aided tools that support the decision making process of an organization. By analyzing enormous volumes of data, decision support systems will provide insightful information to its users. The success of a decision support system relies heavily on both the accuracy of the information that it can provide and the time it requires to provide the information. Conventionally, decision support systems operate using numeric data. The prevalence of graph data has prompted decision support research to begin researching techniques for supporting graph data. Thus far, only graph summarizing and graph pattern mining has been addressed. However, these techniques do not allow for changes in the underlying graph data. When the underlying data is represented by graphs, what types of decision support queries will users ask? This work presents "which" queries, a class of decision support queries that are specific to graph data, and illustrate their potential applications. When an organization makes a decision resulting in a change to the underlying graph data, new edges may eventually be added to the organization's graph data model. The addition of a new edge to the graph will affect how the objects, modeled in the graph, relate to each other. Determining how the object relationships change is a crucial factor that the organization needs to consider. However, determining object relationships is an expensive operation. Furthermore, the solution space that an organization is considering can be considerably large when using graph data; thus, efficient algorithms to evaluate the fundamental "which" queries are also presented. This work will develop a decision support system that effectively and efficiently answers the fundamental "which" queries. First, a model for "which" queries will be developed. Then, algorithms for efficiently answering fundamental "which" queries will be presented, which have been experimentally shown to be orders of magnitude faster than basic solutions. The results of the experiments on five real graph data sets will be presented. Finally, discussion of how the proposed algorithms can be used to answer other types of "which" queries will be presented. | en_US |
| dcterms.extent | xx, 101 p. : ill. ; 30 cm. | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2011 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Phil. | en_US |
| dcterms.LCSH | Decision support systems. | en_US |
| dcterms.LCSH | Querying (Computer science). | en_US |
| dcterms.LCSH | Graph theory -- Data processing. | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | open access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b24562166.pdf | For All Users | 1.58 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/6196