Browsing by Subject "Database Systems"

Now showing 1 - 14 of 14

Open Access
Abstract metaprolog engine
(Elsevier, 1998) Cicekli, I.
A compiler-based meta-level system for MetaProlog language is presented. Since MetaProlog is a meta-level extension of Prolog, the Warren Abstract Machine (WAM) is extended to get an efficient implementation of meta-level facilities; this extension is called the Abstract MetaProlog Engine (AMPE). Since theories and proofs are main meta-level objects in MetaProlog, we discuss their representations and implementations in detail. First, we describe how to efficiently represent theories and derivability relations. At the same time, we present the core part of the AMPE, which supports multiple theories and a fast context switching among theories in the MetaProlog system. Then we describe how to compute proofs, how to shrink the search space of a goal using partially instantiated proofs, and how to represent other control knowledge in a WAM-based system. In addition to computing proofs that are just success branches of search trees, fail branches can also be computed and used in the reasoning process.
Open Access
Automated construction of fuzzy event sets and its application to active databases
(IEEE, 2001) Saygin, Y.; Ulusoy, Özgür
Fuzzy sets and fuzzy logic research aims to bridge the gap between the crisp world of math and the real world. Fuzzy set theory was applied to many different areas, from control to databases. Sometimes the number of events in an event-driven system may become very high and unmanageable. Therefore, it is very useful to organize the events into fuzzy event sets also introducing the benefits of the fuzzy set theory. All the events that have occurred in a system can be stored in event histories which contain precious hidden information. In this paper, we propose a method for automated construction of fuzzy event sets out of event histories via data mining techniques. The useful information hidden in the event history is extracted into a matrix called sequential proximity matrix. This matrix shows the proximities of events and it is used for fuzzy rule execution via similarity based event detection and construction of fuzzy event sets. Our application platform is active databases. We describe how fuzzy event sets can be exploited for similarity based event detection and fuzzy rule execution in active database systems.
Open Access
BilVideo: a video database management system
(IEEE, 2003) Dönderler, M. E.; Şaykol, E.; Ulusoy, Özgür; Güdükbay, Uğur
The BilVideo video database management system provides integrated support for spatiotemporal and semantic queries for video. BilVideo can support any application with video data searching needs. It's query language provides a simple way to extend the system's query capabilities. Users can add application-dependent rules and facts to the knowledge base.
Open Access
Content-based retrieval of historical Ottoman documents stored as textual images
(IEEE, 2004) Şaykol, E.; Sinop, A. K.; Güdükbay, Uğur; Ulusoy, Özgür; Çetin, A. Enis
There is an accelerating demand to access the visual content of documents stored in historical and cultural archives. Availability of electronic imaging tools and effective image processing techniques makes it feasible to process the multimedia data in large databases. In this paper, a framework for content-based retrieval of historical documents in the Ottoman Empire archives is presented. The documents are stored as textual images, which are compressed by constructing a library of symbols occurring in a document, and the symbols in the original image are then replaced with pointers into the codebook to obtain a compressed representation of the image. The features in wavelet and spatial domain based on angular and distance span of shapes are used to extract the symbols. In order to make content-based retrieval in historical archives, a query is specified as a rectangular region in an input image and the same symbol-extraction process is applied to the query region. The queries are processed on the codebook of documents and the query images are identified in the resulting documents using the pointers in textual images. The querying process does not require decompression of images. The new content-based retrieval framework is also applicable to many other document archives using different scripts.
Open Access
Dealing with fuzziness in active mobile database systems
(Elsevier, 1999) Saygın, Y.; Ulusoy, Özgür; Yazıcı, A.
Current needs of industry required the development of advanced database models like active mobile database systems. An active mobile database system can be designed by incorporation of triggering rules into a mobile computing environment in which the users are able to access a collection of database services using mobile and non-mobile computers at any location. Fuzzy concepts are adapted to the field of databases in order to deal with ambiguous, uncertain data. Fuzziness comes into picture in active mobile databases especially with spatial queries on moving objects. Incorporating fuzziness into rules would also improve the effectiveness of active mobile databases as it provides much flexibility in defining rules for the supported application. In this paper we present some methods to adapt the concepts developed for fuzzy systems to active mobile databases.
Open Access
Error-tolerant retrieval of trees
(IEEE, 1997) Oflazer, K.
We present an efficient algorithm for retrieving from a database of trees, all trees that differ from a given query tree by a small number additional or missing leaves, or leaf label changes. It has natural language processing applications in searching for matches in example-based translation systems, and retrieval from lexical databases containing entries of complex feature structures. For large randomly generated synthetic tree databases (some having tens of thousands of trees), and on databases constructed from Wall Street Journal treebank, it can retrieve for trees with a small error, in a matter of tenths of a second to about a second. © 1997 IEEE.
Open Access
An evaluation of real-time transaction management issues in mobile database systems
(Oxford University Press, 1999) Kayan, E.; Ulusoy, Özgür
A critical issue in mobile data management is to respond to real-time data access requirements of the supported application. However, it is difficult to handle real-time constraints in a mobile computing environment due to the physical constraints imposed by the mobile computer hardware and the wireless network technology. In this paper, we present a mobile database system model that takes into account the timing requirements of applications supported by mobile computing systems. We provide a transaction execution model with two alternative execution strategies for mobile transactions and evaluate the performance of the system considering various mobile system characteristics, such as the number of mobile hosts in the system, the handoff process, disconnection, coordinator site relocation and wireless link failure. Performance results are provided in terms of the fraction of real-time requirements that are satisfied.
Open Access
Exploiting data mining techniques for broadcasting data in mobile computing environments
(IEEE, 2002) Saygin, Y.; Ulusoy, Özgür
Mobile computers can be equipped with wireless communication devices that enable users to access data services from any location. In wireless communication, the server-to-client (downlink) communication bandwidth is much higher than the client-to-server (uplink) communication bandwidth. This asymmetry makes the dissemination of data to client machines a desirable approach. However, dissemination of data by broadcasting may induce high access latency in case the number of broadcast data items is large. In this paper, we propose two methods aiming to reduce client access latency of broadcast data. Our methods are based on analyzing the broadcast history (i.e., the chronological sequence of items that have been requested by clients) using data mining techniques. With the first method, the data items in the broadcast disk are organized in such a way that the items requested subsequently are placed close to each other. The second method focuses on improving the cache hit ratio to be able to decrease the access latency. It enables clients to prefetch the data from the broadcast disk based on the rules extracted from previous data request patterns. The proposed methods are implemented on a Web log to estimate their effectiveness. It is shown through performance experiments that the proposed rule-based methods are effective in improving the system performance in terms of the average latency as well as the cache hit ratio of mobile clients.
Unknown
Graph visualization toolkits
(IEEE, 2002) Dogrusoz, U.; Feng, Q.; Madden, B.; Doorley, M.; Frick, A.
The Graph Layout Toolkit and Graph Editor Toolkit, which provide a framework for graph visualization useful in a broad array of application areas are introduced. As such, an architectural overview of these tools is presented and discusses the challenges encountered during implementation and integration of theory and research results into such tools. In particular, the automatic graph layout and labeling algorithms and complexity management techniques are discussed. In addition, some examples of applications using these tools are presented.
Unknown
Hypergraph models and algorithms for data-pattern-based clustering
(Springer, 2004) Ozdal, M. M.; Aykanat, Cevdet
In traditional approaches for clustering market basket type data, relations among transactions are modeled according to the items occurring in these transactions. However, an individual item might induce different relations in different contexts. Since such contexts might be captured by interesting patterns in the overall data, we represent each transaction as a set of patterns through modifying the conventional pattern semantics. By clustering the patterns in the dataset, we infer a clustering of the transactions represented this way. For this, we propose a novel hypergraph model to represent the relations among the patterns. Instead of a local measure that depends only on common items among patterns, we propose a global measure that is based on the cooccurences of these patterns in the overall data. The success of existing hypergraph partitioning based algorithms in other domains depends on sparsity of the hypergraph and explicit objective metrics. For this, we propose a two-phase clustering approach for the above hypergraph, which is expected to be dense. In the first phase, the vertices of the hypergraph are merged in a multilevel algorithm to obtain large number of high quality clusters. Here, we propose new quality metrics for merging decisions in hypergraph clustering specifically for this domain. In order to enable the use of existing metrics in the second phase, we introduce a vertex-to-cluster affinity concept to devise a method for constructing a sparse hypergraph based on the obtained clustering. The experiments we have performed show the effectiveness of the proposed framework.
Unknown
OBJECTIVE: A benchmark for object-oriented active database systems
(Elsevier, 1999) Çetintemel, U.; Zimmermann, J.; Ulusoy, Özgür; Buchmann, A.
Although much work in the area of Active Database Management Systems (ADBMSs) has been done, it is not yet clear how the performance of an active DBMS can be evaluated systematically. In this paper, we describe the OBJECTIVE Benchmark for object-oriented ADBMSs, and present experimental results from its implementation in an active database system prototype. OBJECTIVE can be used to identify performance bottlenecks and active functionalities of an ADBMS, and to compare the performance of multiple ADBMSs.
Unknown
Optimization of signature file parameters for databases with varying record lengths
(Oxford University Press, 1999) Kocberber, S.; Can, F.; Patton, J. M.
For signature files we propose a new false drop estimation method for databases with varying record lengths. Our approach provides more accurate estimation of the number of false drops by considering the lengths of individual records instead of using the average number of terms per record. In signature file processing, accurate estimation of the number of false drops is essential to obtain a more accurate signature file and therefore to obtain a better (query) response time. With a formal proof we show that under certain conditions the number of false drops estimated by considering the average record length is less than or equal to the precise 'expected' estimation which is based on the individual record lengths. The experiments with real data show that the proposed method accurately estimates the number of false drops and the actual response time. Depending on the space overhead, our approach obtains up to 33% and 20% response time improvements for the conventional sequential and new efficient multiframe signature file methods, respectively.
Unknown
An overview of regression techniques for knowledge discovery
(Cambridge University Press, 1999) Uysal, İ.; Güvenir, H. A.
Predicting or learning numeric features is called regression in the statistical literature, and it is the subject of research in both machine learning and statistics. This paper reviews the important techniques and algorithms for regression developed by both communities. Regression is important for many applications, since lots of real life problems can be modeled as regression problems. The review includes Locally Weighted Regression (LWR), rule-based regression, Projection Pursuit Regression (PPR), instance-based regression, Multivariate Adaptive Regression Splines (MARS) and recursive partitioning regression methods that induce regression trees (CART, RETIS and M5).
Unknown
Research issues in real-time database systems . Survey paper
(Elsevier, 1995) Ulusoy, Özgür
Today's real-time systems are characterized by managing large volumes of data. Efficient database management algorithms for accessing and manipulating data are required to satisfy timing constraints of supported applications. Real-time database systems involve a new research area investigating possible ways of applying database systems technology to real-time systems. Management of real-time information through a database system requires the integration of concepts from both real-time systems and database systems. Some new criteria need to be developed to involve timing constraints of real-time applications in many database systems design issues, such as transaction/query processing, data buffering, CPU, and IO scheduling. In this paper, a basic understanding of the issues in real-time database systems is provided and the research efforts in this area are introduced. Different approaches to various problems of real-time database systems are briefly described, and possible future research directions are discussed. © 1995.