Open Access. Powered by Scholars. Published by Universities.®

Databases and Information Systems Commons™

Open Access. Powered by Scholars. Published by Universities.®

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 5251 - 5280 of 7256

Full-Text Articles in Databases and Information Systems

Understanding The Values Of Mobile Technology In Education: A Value-Focused Thinking Approach, Hong Sheng, Keng Siau, Fiona Nah May 2010

Understanding The Values Of Mobile Technology In Education: A Value-Focused Thinking Approach, Hong Sheng, Keng Siau, Fiona Nah

Research Collection School Of Computing and Information Systems

Mobile technology has mobilized the human interaction in all dimensions by supporting mobile collaboration. As collaboration is key to learning in today's educational environment, mobile technology has tremendous potential in supporting and improving education and its delivery. Given that mobile technology for education is a new phenomenon that is gaining popularity, the values of using mobile technology to support education need to be further researched and better understood. In this research, we used the Value-Focused Thinking approach to interview students and instructors to identify the values of education that are enabled by mobile technology. These values are represented in the …

Go to article

Rapport: Semantic-Sensitive Namespace Management In Large-Scale File Systems, Yu Hua, Hong Jiang, Yifeng Zhu, Dan Feng Apr 2010

Rapport: Semantic-Sensitive Namespace Management In Large-Scale File Systems, Yu Hua, Hong Jiang, Yifeng Zhu, Dan Feng

School of Computing: Technical Reports

Explosive growth in volume and complexity of data exacerbates the key challenge to effectively and efficiently manage data in a way that fundamentally improves the ease and efficacy of their use. Existing large-scale file systems rely on hierarchically structured namespace that leads to severe performance bottlenecks and renders it impossible to support real-time queries on multi-dimensional attributes. This paper proposes a novel semantic-sensitive scheme, called Rapport, to provide dynamic and adaptive namespace management and support complex queries. The basic idea is to build files’ namespace by utilizing their semantic correlation and exploiting dynamic evolution of attributes to support namespace management. …

Go to article

Trust In Social And Sensor Networks, Pramod Anantharam, Krishnaprasad Thirunarayan, Cory Andrew Henson, Amit P. Sheth Apr 2010

Trust In Social And Sensor Networks, Pramod Anantharam, Krishnaprasad Thirunarayan, Cory Andrew Henson, Amit P. Sheth

Kno.e.sis Publications

Trust can be defined as the perception of the trustor about the degree to which the trustee would satisfy an expectation about a transaction constituting risk. Trust plays a pivotal role when the risk in believing incorrect information is high. With Web 2.0 where user generated content and real time interactions dominate, the openness of data contribution may hinder the quality of information we can get.

Go to article

What Goes Around Comes Around - Improving Linked Open Data Through On-Demand Model Creation, Christopher Thomas, Wenbo Wang, Pankaj Mehra, Delroy H. Cameron, Pablo N. Mendes, Amit P. Sheth Apr 2010

What Goes Around Comes Around - Improving Linked Open Data Through On-Demand Model Creation, Christopher Thomas, Wenbo Wang, Pankaj Mehra, Delroy H. Cameron, Pablo N. Mendes, Amit P. Sheth

Kno.e.sis Publications

Web 2.0 has changed the way we share and keep up with information. We communicate through social media platforms and make the information we exchange to a large extent publicly available. Linked Open Data (LOD) follows the same paradigm of sharing information but also makes it machine accessible. LOD provides an abundance of structured information albeit in a less formally rigorous form than would be desirable for Semantic Web applications. Nevertheless, most of the LOD assertions are community reviewed and we can rely on their accuracy to a large extent. In this work we want to follow the Web 2.0 …

Go to article

Information Technology Implementation Decisions To Support The Kentucky Mesonet, D. Michael Grogan Apr 2010

Information Technology Implementation Decisions To Support The Kentucky Mesonet, D. Michael Grogan

Masters Theses & Specialist Projects

The Kentucky Mesonet is a high-density, mesoscale network of automated meteorological and climatological sensing platforms being developed across the commonwealth. Data communications, collection, processing, and delivery mechanisms play a critical role in such networks, and the World Meteorological Organization recognizes that “an observing system is not complete unless it is connected to other systems that deliver the data to the users.” This document reviews the implementation steps, decisions, and rationale surrounding communications and computing infrastructure development to support the Mesonet. A general overview of the network and technology-related research is provided followed by a review of pertinent literature related to …

Go to article

Dynamic Associative Relationships On The Linked Open Data Web, Pablo N. Mendes, Pavan Kapanipathi, Delroy H. Cameron, Amit P. Sheth Apr 2010

Dynamic Associative Relationships On The Linked Open Data Web, Pablo N. Mendes, Pavan Kapanipathi, Delroy H. Cameron, Amit P. Sheth

Kno.e.sis Publications

We provide a definition of context based on theme, time and location, and propose a mixed retrieval/extraction model for the dynamic suggestion of trending relationships to LOD resources.

Go to article

Semantics-Empowered Text Exploration For Knowledge Discovery, Delroy H. Cameron, Pablo N. Mendes, Amit P. Sheth, Victor Chan Apr 2010

Semantics-Empowered Text Exploration For Knowledge Discovery, Delroy H. Cameron, Pablo N. Mendes, Amit P. Sheth, Victor Chan

Kno.e.sis Publications

The interaction paradigm offered by most contemporary Web Information Systems is a search-and-sift paradigm in which users manually seek information using hyperlinked documents. This paradigm is derived from a document-centric model that gives users minimal support for scanning through high volumes of text. We present a novel information exploration paradigm based on a data-centric view of corpora, along with a prototype implementation that demonstrates the value in content-driven navigation. We leverage semantic metadata to link data in documents by exploiting named relationships between entities. We also present utilities for gathering user generated navigation trails, critical for knowledge discovery. We discuss …

Go to article

Pagesense: Style-Wise Web Page Advertising, Lusong Li, Tao Mei, Xiang Niu, Chong-Wah Ngo Apr 2010

Pagesense: Style-Wise Web Page Advertising, Lusong Li, Tao Mei, Xiang Niu, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper presents an innovative style-wise advertising platform for web page. Web page “style” mainly refers to visual effects, such as color and layout. Unlike the most popular ad-network such as Google AdSense which needs publishers to change the original structure of their pages and define the position and style of the embedded ads manually, stylewise page advertising aims to automatically deliver styleconsistent ads at proper positions within the web page, without breaking the layout of the original page. Our system is motivated from the fact that almost 90% web pages contain blank regions without any content. Given a web …

Go to article

A Social Network Based Study Of Software Team Dynamics, Subhajit Datta, Vikrant S. Kaulgoud, Vibhu Saujanya Sharma, Nishant Kumar Apr 2010

A Social Network Based Study Of Software Team Dynamics, Subhajit Datta, Vikrant S. Kaulgoud, Vibhu Saujanya Sharma, Nishant Kumar

Research Collection School Of Computing and Information Systems

Members of software project teams have specific roles and responsibilities which are formally defined during project inception or at the start of a life cycle activity. Often, the team structure undergoes spontaneous changes as delivery deadlines draw near and critical tasks have to be completed. Some members -- depending on their skill or seniority -- need to take on more responsibilities, while others end up being peripheral to the project's execution. We posit that this kind of ad hoc reorganization of a team's structure can be discerned from the project's bug tracker. In this paper, we extract a social network …

Go to article

Algorithms For Constrained K-Nearest Neighbor Queries Over Moving Object Trajectories, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, Chun Chen Apr 2010

Algorithms For Constrained K-Nearest Neighbor Queries Over Moving Object Trajectories, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, Chun Chen

Research Collection School Of Computing and Information Systems

An important query for spatio-temporal databases is to find nearest trajectories of moving objects. Existing work on this topic focuses on the closest trajectories in the whole data space. In this paper, we introduce and solve constrained k-nearest neighbor (CkNN) queries and historical continuous CkNN (HCCkNN) queries on R-tree-like structures storing historical information about moving object trajectories. Given a trajectory set D, a query object (point or trajectory) q, a temporal extent T, and a constrained region CR, (i) a CkNN query over trajectories retrieves from D within T, the k (≥ 1) trajectories that lie closest to q and …

Go to article

Adaptive Ensemble Classification In P2p Networks, Hock Hee Ang, Vivekanand Gopalkrishnan, Steven C. H. Hoi, Wee Keong Ng Apr 2010

Adaptive Ensemble Classification In P2p Networks, Hock Hee Ang, Vivekanand Gopalkrishnan, Steven C. H. Hoi, Wee Keong Ng

Research Collection School Of Computing and Information Systems

Classification in P2P networks has become an important research problem in data mining due to the popularity of P2P computing environments. This is still an open difficult research problem due to a variety of challenges, such as non-i.i.d. data distribution, skewed or disjoint class distribution, scalability, peer dynamism and asynchronism. In this paper, we present a novel P2P Adaptive Classification Ensemble (PACE) framework to perform classification in P2P networks. Unlike regular ensemble classification approaches, our new framework adapts to the test data distribution and dynamically adjusts the voting scheme by combining a subset of classifiers/peers according to the test data …

Go to article

Efficient Skyline Maintenance For Streaming Data With Partially-Ordered Domains, Yuan Fang, Chee-Yong Chan Apr 2010

Efficient Skyline Maintenance For Streaming Data With Partially-Ordered Domains, Yuan Fang, Chee-Yong Chan

Research Collection School Of Computing and Information Systems

We address the problem of skyline query processing for a count-based window of continuous streaming data that involves both totally- and partially-ordered attribute domains. In this problem, a fixed-size buffer of the N most recent tuples is dynamically maintained and the key challenge is how to efficiently maintain the skyline of the sliding window of N tuples as new tuples arrive and old tuples expire. We identify the limitations of the state-of-the-art approach STARS, and propose two new approaches, STARS+ and SkyGrid, to address its drawbacks. STARS+ is an enhancement of STARS with three new optimization techniques, while SkyGrid is …

Go to article

Optimal Matching Between Spatial Datasets Under Capacity Constraints, Hou U Leong, Kyriakos Mouratidis, Man Lung Yiu, Nikos Mamoulis Apr 2010

Optimal Matching Between Spatial Datasets Under Capacity Constraints, Hou U Leong, Kyriakos Mouratidis, Man Lung Yiu, Nikos Mamoulis

Research Collection School Of Computing and Information Systems

Consider a set of customers (e.g., WiFi receivers) and a set of service providers (e.g., wireless access points), where each provider has a capacity and the quality of service offered to its customers is anti-proportional to their distance. The capacity constrained assignment (CCA) is a matching between the two sets such that (i) each customer is assigned to at most one provider, (ii) every provider serves no more customers than its capacity, (iii) the maximum possible number of customers are served, and (iv) the sum of Euclidean distances within the assigned provider-customer pairs is minimized. Although max-flow algorithms are applicable …

Go to article

Mining Diversity On Networks, Lu Liu, Feida Zhu, Chen Chen, Xifeng Yan, Jiawei Han, Philip Yu, Shiqiang Yang Apr 2010

Mining Diversity On Networks, Lu Liu, Feida Zhu, Chen Chen, Xifeng Yan, Jiawei Han, Philip Yu, Shiqiang Yang

Research Collection School Of Computing and Information Systems

Despite the recent emergence of many large-scale networks in different application domains, an important measure that captures a participant’s diversity in the network has been largely neglected in previous studies. Namely, diversity characterizes how diverse a given node connects with its peers. In this paper, we give a comprehensive study of this concept. We first lay out two criteria that capture the semantic meaning of diversity, and then propose a compliant definition which is simple enough to embed the idea. An efficient top-k diversity ranking algorithm is developed for computation on dynamic networks. Experiments on both synthetic and real datasets …

Go to article

Do You Trust To Get Trust? A Study Of Trust Reciprocity Behaviors And Reciprocal Trust Prediction, Viet-An Nguyen, Ee Peng Lim, Hwee Hoon Tan, Jing Jiang, Aixin Sun Apr 2010

Do You Trust To Get Trust? A Study Of Trust Reciprocity Behaviors And Reciprocal Trust Prediction, Viet-An Nguyen, Ee Peng Lim, Hwee Hoon Tan, Jing Jiang, Aixin Sun

Research Collection School Of Computing and Information Systems

Trust reciprocity, a special form of link reciprocity, exists in many networks of trust among users. In this paper, we seek to determine the extent to which reciprocity exists in a trust network and develop quantitative models for measuring reciprocity and reciprocity related behaviors. We identify several reciprocity behaviors and their respective measures. These behavior measures can be employed for predicting if a trustee will return trust to her trustor given that the latter initiates a trust link earlier. We develop for this reciprocal trust prediction task a number of ranking method and classification methods, and evaluated them on an …

Go to article

Generating Synonyms Based On Query Log Data, Stelios Paparizos, Tao Cheng, Hady W. Lauw Apr 2010

Generating Synonyms Based On Query Log Data, Stelios Paparizos, Tao Cheng, Hady W. Lauw

Research Collection School Of Computing and Information Systems

An approach is described for generating synonyms to supplement at least one information item, such as, in one case, a set of related items. The approach can involve an expansion phase, a clean-up phase, and a reduction phase. In the expansion phase, the approach identifies, for each related item, a set of initial synonym candidates. In the clean-up phase, the approach removes noise from the set of initial synonym candidates (if such noise exists), to provide a set of filtered synonym candidate items. In the reduction phase, the approach ranks and applies a threshold (or thresholds) to the set of …

Go to article

Managing Media Rich Geo-Spatial Annotations For A Map-Based Mobile Application Using Clustering, Khasfariyati Razikin, Dion Hoe-Lian Goh, Ee Peng Lim, Aixin Sun, Yin-Leng Theng, Thi Nhu Quynh Kim, Kalyani Chatterjea, Chew-Hung Chang Apr 2010

Managing Media Rich Geo-Spatial Annotations For A Map-Based Mobile Application Using Clustering, Khasfariyati Razikin, Dion Hoe-Lian Goh, Ee Peng Lim, Aixin Sun, Yin-Leng Theng, Thi Nhu Quynh Kim, Kalyani Chatterjea, Chew-Hung Chang

Research Collection School Of Computing and Information Systems

With the prevalence of mobile devices that are equipped with wireless Internet capabilities and Global Positioning System (GPS) functionality, the creation and access of user-generated content are extended to users on the go. Such content are tied to real world objects, in the form of geospatial annotations, and it is only natural that these annotations are visualized using a map-based approach. However, viewing maps that are filled with annotations could hinder the serendipitous discovery of data, especially on the small screens of mobile devices. This calls for a need to manage the annotations. In this paper, we introduce a mobile …

Go to article

Data Mining Based Predictive Models For Overall Health Indices, Ridhima Rajkumar, Kyong Jin Shim, Jaideep Srivastava Apr 2010

Data Mining Based Predictive Models For Overall Health Indices, Ridhima Rajkumar, Kyong Jin Shim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

In this study, we infer health care indices of individuals using their pharmacy medical and prescription claims. Specifically, we focus on the widely used Charlson Index. We use data mining techniques to formulate the problem of classifying Charlson Index (CI) and build predictive models to predict individual health index score. First, we present comparative analyses of several classification algorithms. Second, our study shows that certain ensemble algorithms lead to higher prediction accuracy in comparison to base algorithms. Third, we introduce cost-sensitive learning to the classification algorithms and show that the inclusion of cost-sensitive learning leads to improved prediction accuracy. The …

Go to article

A Pda Intervention To Sustain Smoking Cessation In Clients With Socioeconomic Vulnerability, Lynne Buchanan, Deepak Khazanchi Apr 2010

A Pda Intervention To Sustain Smoking Cessation In Clients With Socioeconomic Vulnerability, Lynne Buchanan, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Publications

This article describes a pilot study to explore use of a personal digital assistant (PDA) to sustain smoking cessation after discharge in clients with socioeconomic vulnerability. The major aim is to describe technology acceptance (perceived ease of use, usefulness, and attitude), portability, technical difficulty, satisfaction, and use time. The sample includes 31 medical surgical clients with average age of 47.35 (±13.3), average household income of $13,629 (±8,204), average number in the household of 2.67 (±2.22), and average education of 11th grade. The results demonstrate mean use time of 9.28 (±3.23) hr, or about 1 hr over 8 weeks. Technology acceptance …

Go to article

Information Search Patterns In E-Commerce Product Comparison Services, Fiona Fui-Hoon Nah, Weiyin Hong, Liqiang Chen, Hong-Hee Lee Apr 2010

Information Search Patterns In E-Commerce Product Comparison Services, Fiona Fui-Hoon Nah, Weiyin Hong, Liqiang Chen, Hong-Hee Lee

Research Collection School Of Computing and Information Systems

To facilitate product selection and purchase decisions on e-commerce Web sites, the presentation of product information is very important. In this research, the authors study how disposition styles influence users’ search patterns in product comparison services of e-commerce Web sites. The results show that people use relatively more feature paths and less product paths in vertical disposition style than horizontal disposition style. The findings also indicate that there are relatively more feature paths and less product paths in the first half than second half of the information search paths. This is consistent with Gensch’s two-stage choice model which suggests that …

Go to article

Continuous Spatial Assignment Of Moving Users, Hou U Leong, Kyriakos Mouratidis, Nikos Mamoulis Apr 2010

Continuous Spatial Assignment Of Moving Users, Hou U Leong, Kyriakos Mouratidis, Nikos Mamoulis

Research Collection School Of Computing and Information Systems

Consider a set of servers and a set of users, where each server has a coverage region (i.e., an area of service) and a capacity (i.e., a maximum number of users it can serve). Our task is to assign every user to one server subject to the coverage and capacity constraints. To offer the highest quality of service, we wish to minimize the average distance between users and their assigned server. This is an instance of a well-studied problem in operations research, termed optimal assignment. Even though there exist several solutions for the static case (where user locations are fixed), …

Go to article

Tredd—A Database For Tandem Repeats Over The Edit Distance, Dina Sokol, Firat Atagun Mar 2010

Tredd—A Database For Tandem Repeats Over The Edit Distance, Dina Sokol, Firat Atagun

Publications and Research

A ‘tandem repeat’ in DNA is a sequence of two or more contiguous, approximate copies of a pattern of nucleotides. Tandem repeats are common in the genomes of both eukaryotic and prokaryotic organisms. They are significant markers for human identity testing, disease diagnosis, sequence homology and population studies. In this article, we describe a new database, TRedD, which contains the tandem repeats found in the human genome. The database is publicly available online, and the software for locating the repeats is also freely available. The definition of tandem repeats used by TRedD is a new and innovative definition based upon …

Go to article

Multi-Objective Constraint Satisfaction For Mobile Robot Area Defense, Kenneth W. Mayo Mar 2010

Multi-Objective Constraint Satisfaction For Mobile Robot Area Defense, Kenneth W. Mayo

Theses and Dissertations

In developing multi-robot cooperative systems, there are often competing objectives that need to be met. For example in automating area defense systems, multiple robots must work together to explore the entire area, and maintain consistent communications to alert the other agents and ensure trust in the system. This research presents an algorithm that tasks robots to meet the two specific goals of exploration and communication maintenance in an uncoordinated environment reducing the need for a user to pre-balance the objectives. This multi-objective problem is defined as a constraint satisfaction problem solved using the Non-dominated Sorting Genetic Algorithm II (NSGA-II). Both …

Go to article

Local Coordination Under Bounded Rationality: Coase Meets Simon, Finds Hayek, C. Jason Woodard Mar 2010

Local Coordination Under Bounded Rationality: Coase Meets Simon, Finds Hayek, C. Jason Woodard

Research Collection School Of Computing and Information Systems

This paper explores strategic behavior in a network of firms using an agent-based model. The model exhibits a tension between economic efficiency and the stability of the network in the face of incentives to change its configuration. This tension is to be expected because the conditions of the Coase theorem are violated: the boundedly rational firms in the model lack the ability to discover efficient network configurations or achieve them through collective action. In computational experiments, as predicted by theory, firms frequently became locked into inefficient outcomes or endless cycles of mutual frustration. However, simple institutional innovations such as property …

Go to article

Information-Quality Aware Routing In Event-Driven Sensor Networks, Hwee Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng-Yong Kong, Chen-Khong Tham Mar 2010

Information-Quality Aware Routing In Event-Driven Sensor Networks, Hwee Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng-Yong Kong, Chen-Khong Tham

Research Collection School Of Computing and Information Systems

Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/or fusion techniques exploit spatio-temporal correlation among sensory data to reduce traffic load and mitigate congestion. However, this is often at the expense of loss in Information Quality (IQ) of data that is collected at the fusion center. In this work, we address the problem of finding the least-cost routing tree that satisfies a given IQ constraint. We note that the optimal least-cost routing solution is a variation of the classical NP-hard Steiner tree …

Go to article

Differentiating Knowledge Processes In Organisational Learning: A Case Of “Two Solitudes”, Siu Loon Hoe, Steven Mcshane Mar 2010

Differentiating Knowledge Processes In Organisational Learning: A Case Of “Two Solitudes”, Siu Loon Hoe, Steven Mcshane

Research Collection School Of Computing and Information Systems

The fields of organizational behavior (OB)/strategy and marketing have taken different paths over the past two decades to understanding organizational learning. OB/strategy has been pre-occupied with theory development and case study illustrations, whereas marketing has taken a highly quantitative path. Although relying on essentially the same foundation theory, the two disciplines have had minimal crossfertilization. Furthermore, both fields tend to blur or usually ignore the distinction between structural and informal knowledge processes. The purpose of the paper is to highlight the distinction between informal and structural knowledge acquisition and dissemination processes and propose new definitions to differentiate them. Future research …

Go to article

Creating An Immersive Game World With Evolutionary Fuzzy Cognitive Maps, Yundong Cai, Ah-Hwee Tan, Zhiqi Shen, Boyang Li Mar 2010

Creating An Immersive Game World With Evolutionary Fuzzy Cognitive Maps, Yundong Cai, Ah-Hwee Tan, Zhiqi Shen, Boyang Li

Research Collection School Of Computing and Information Systems

An increasing number of serious games have been developed to enhance the user experiences in education and training. In order to bridge the gap of game experiences in the virtual environment and in the real life, it is crucial to generate believable characters and contexts in real-time. However, the variables to be simulated for a large-scale serious game are numerous. These variables are involved in complex causal relationships and their values change over time. In view that world modeling has not been well addressed with conventional models, this paper uses a computational model Evolutionary Fuzzy Cognitive Map (EFCM) to model …

Go to article

A Self-Organizing Neural Architecture Integrating Desire, Intention And Reinforcement Learning, Ah-Hwee Tan, Yu-Hong Feng, Yew-Soon Ong Mar 2010

A Self-Organizing Neural Architecture Integrating Desire, Intention And Reinforcement Learning, Ah-Hwee Tan, Yu-Hong Feng, Yew-Soon Ong

Research Collection School Of Computing and Information Systems

This paper presents a self-organizing neural architecture that integrates the features of belief, desire, and intention (BDI) systems with reinforcement learning. Based on fusion Adaptive Resonance Theory (fusion ART), the proposed architecture provides a unified treatment for both intentional and reactive cognitive functionalities. Operating with a sense-act-learn paradigm, the low level reactive module is a fusion ART network that learns action and value policies across the sensory, motor, and feedback channels. During performance, the actions executed by the reactive module are tracked by a high level intention module (also a fusion ART network) that learns to associate sequences of actions …

Go to article

Preference Queries In Large Multi-Cost Transportation Networks, Kyriakos Mouratidis, Yimin Lin, Man Lung Yiu Mar 2010

Preference Queries In Large Multi-Cost Transportation Networks, Kyriakos Mouratidis, Yimin Lin, Man Lung Yiu

Research Collection School Of Computing and Information Systems

Research on spatial network databases has so far considered that there is a single cost value associated with each road segment of the network. In most real-world situations, however, there may exist multiple cost types involved in transportation decision making. For example, the different costs of a road segment could be its Euclidean length, the driving time, the walking time, possible toll fee, etc. The relative significance of these cost types may vary from user to user. In this paper we consider such multi-cost transportation networks (MCN), where each edge (road segment) is associated with multiple cost values. We formulate …

Go to article

Efficient Verification Of Shortest Path Search Via Authenticated Hints, Man Lung Yiu, Yimin Lin, Kyriakos Mouratidis Mar 2010

Efficient Verification Of Shortest Path Search Via Authenticated Hints, Man Lung Yiu, Yimin Lin, Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

Shortest path search in transportation networks is unarguably one of the most important online search services nowadays (e.g., Google Maps, MapQuest, etc), with applications spanning logistics, spatial optimization, or everyday driving decisions. Often times, the owner of the road network data (e.g., a transport authority) provides its database to third-party query services, which are responsible for answering shortest path queries posed by their clients. The issue arising here is that a query service might be returning sub-optimal paths either purposely (in order to serve its own purposes like computational savings or commercial reasons) or because it has been compromised by …

Go to article

First Prev Next Last