5147118
Location dependent query processing
The advances in wireless and mobile computing allow a mobile user to perform a wide range of aplications once limited to non-mobile hard wired computing environments. As the geographical position of a mobile user is becoming more trackable, users need to pull data which are related to their location, perhaps seeking information about unfamiliar places or local lifestyle data. In these requests, a location attribute has to be identified in order to provide more efficient access to location dependent data, whose value is determined by the location to which it is related. Local yellow pages, local events, and weather information are some of the examples of these data.
In this paper, we give a formalization of location relatedness in queries. We differentiate location dependence and location awareness and provide thorough examples to support our approach.
16958826
Recent Advances and Research Problems in Data Warehousing
In the recent years, the database community has witnessed the emergence of a new technology, namely data warehousing. A data warehouse is a global repository that stores pre-processed queries on data which resides in multiple, possibly heterogeneous, operational or legacy sources. The information stored in the data warehouse can be easily and efficiently accessed for making effective decisions. The On-Line Analytical Processing (OLAP) tools access data from the data warehouse for complex data analysis, such as multidimensional data analysis, and decision support activities. Current research has lead to new developments in all aspects of data warehousing, however, there are still a number of problems that need to be solved for making data warehousing effective. In this paper, we discuss recent developments in data warehouse modelling, view maintenance, and parallel query processing. A number of technical issues for exploratory research are presented and possible solutions are discussed.
39362526
Main memory database recovery algorithms and their performance
In main memory systems recovery becomes more complex mainly due to the volatility of main memory and the elimination of the separation of data storage (disk) and data processing locations (main memory). In a disk based database system, it is the disk copy that represents the stable database restored after a system failure; but in MDBSs, the main memory copy of the database must be recovered. The paper discusses the recovery issues in MDBSs and presents a somewhat detailed performance study of two recovery algorithms, one using a shadow approach and the other update-in-place.<<ETX>>
29393244
Semantic Caching and Query Processing
Semantic caching is very attractive for use in distributed systems due to the reduced network traffic and the improved response time. It is particularly efficient for a mobile computing environment, where the bandwidth of wireless links is a major performance bottleneck. Previous work either does not provide a formal semantic caching model, or lacks efficient query processing strategies. This paper extends the existing research in three ways: formal definitions associated with semantic caching are presented, query processing strategies are investigated and, finally, the performance of the semantic cache model is examined through a detailed simulation study.
34436430
An Integrated Data Structure with Multiple Access Paths for Database Systems and its Performance
Abstract In the past a number of file organizations have been proposed for processing different types of queries efficiently. To our knowledge none of the existing file organizations is capable of supporting all types of accesses equally efficiently. In this paper we have taken a different approach for designing an integated data structure which offers multiple access paths for processing different types of queries efficiently. The data structure reported here can be implemented on disk based as well as main memory database systems, however, in this paper we report its behavior mainly in main memory database environment. Our approach is to fuse those data structures which offer an efficient access paths for a particular type. To show the feasibility of our scheme we fused the B+-tree, the grid file and extendible hashing structures, using a proper interface. We implemented and measured its performance through simulation modeling. Our results show that the data structure does improve concurrency and offers a higher throughput for a variety of transaction processing workloads. We argue that our scheme is different than creating secondary indexes for improving concurrency. In the absence of a data strucure which can provide all types of access equally efficiently, an integrated data structure is an acceptable solution which offers an efficient way for increasing the performance of database management systems.
8261257
TCOT-A Timeout-Based Mobile Transaction Commitment Protocol
We present a transaction commit protocol, "Transaction Commit On Timeout (TCOT)," based on a "timeout" approach for Mobile Database Systems (MDS), which can be universally used to reach a final transaction termination decision (e.g., commit, abort, etc.) in any message-oriented system. Particularly suited for a wireless environment, a timeout mechanism is the only way to minimize the impact of the slow and unreliable wireless link. We compare TCOT to a modified version of 2PC to show its superiority based on commit time.
11502954
Motion generation for formations of robots: A geometric approach
Develops a method for generating smooth trajectories for mobile robots in formation. The problem of trajectory generation is cast in terms of designing optimal curves on the Euclidean group, SE(3). Specifically, the method generates the trajectory that minimizes the total energy associated with the translations and rotations of the robots, while maintaining a rigid formation. When the mobile robots are nonholonomic, trajectories that allow rigid formations to be maintained must satisfy appropriate constraints. An efficient non-iterative algorithm to obtain near-optimal trajectories is described. Finally, the approach is illustrated with examples involving formations of aircrafts.
206537669
Optimal control of systems with unilateral constraints
Problems in robotics and biomechanics such as trajectory planning or resolution of redundancy can be effectively solved using optimal control. Such systems are often subject to unilateral constraints. Examples include tasks involving contacts (e.g., walking, running, multifingered or multiarm manipulation), and other tasks that may not involve contacts but in which the system state or the inputs must satisfy inequality conditions (e.g., limits on actuator forces). This paper shows how problems of optimal control in robotics that involve unilateral constraints can be efficiently solved by first formulating the constrained optimal control problem as an unconstrained problem of the calculus of variations and then solving it using an integral formulation. This method has several advantages over the Pontryagin minimum principle which is traditionally employed to solve such problems. An example of two-arm manipulation with inequality constraints due to Coulomb friction is used to demonstrate the formulation of the problem and the algorithms.
10798770
Hierarchical Hybrid Modeling of Embedded Systems
This paper describes the modeling language CHARON for modular design of interacting hybrid systems. The language allows specification of architectural as well as behavioral hierarchy, and discrete as well as continuous activities. The modular structure of the language is not merely syntactic, but is exploited by analysis tools, and is supported by a formal semantics with an accompanying compositional theory of refinement. We illustrate the benefits of CHARON in design of embedded control software using examples from automated highways concerning vehicle coordination.
41766531
High Performance Data Mining
The current decade has seen an explosive growth in database technology and the amount of data collected. This has created an unprecedented opportunity for ”data mining,” which is a process of efficient supervised or unsupervised discovery of interesting information hidden in the data. The focus of this symposium is to bring together experts from the academia and the industry, including reseachers and practitioners, to discuss issues in this important area. Owing to the huge size of data and computation involved in data mining algorithms, parallel processing is often considered an essential component for a successful data mining solution - which will be a special emphasis of the symposium. Talks in this mini-symposium will cover both the current state-of the-practice as well as state-of-the-research in data mining. A highlight of the symposium is a panel discussion on the theory and practice of data mining.
5797236
Strong edge coloring for channel assignment in wireless radio networks
We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links between transceivers in the network