By Topic

Seventh International Database Engineering and Applications Symposium, 2003. Proceedings.

18-18 July 2003

Filter Results

Displaying Results 1 - 25 of 51
  • Proceedings International Database Engineering and Applications Symposium

    Publication Year: 2003
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    The following topics are dealt with: database engineering; database applications; data modeling, database modeling; data mining; XML data management; advanced database techniques; imprecise and temporal databases; XML data querying; Web issues; database reliability; database stability; and database security. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author index

    Publication Year: 2003, Page(s):399 - 400
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Freely Available from IEEE
  • Neighborhood signatures for searching P2P networks

    Publication Year: 2003, Page(s):149 - 158
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (317 KB) | HTML iconHTML

    Overlay networks have received a lot of attention due to the recent widespread use of peer-to-peer (P2P) applications such as SETI, Napster, Gnutella, and Morpheus. Through replications at numerous peers, digital content can be distributed or exchanged with high resilience and availability. However, existing P2P applications incur excessive overhead on network traffic. For example, Gnutella, which... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specification and management of QoS in imprecise real-time databases

    Publication Year: 2003, Page(s):192 - 201
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB) | HTML iconHTML

    Real-time applications such as e-commerce, flight control, chemical and nuclear control, and telecommunication are becoming increasingly sophisticated in their data needs, resulting in greater demands for real-time data services. Since the workload of real-time databases (RTDBs), providing real-time data services, cannot be precisely predicted, they can become overloaded and thereby cause temporal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Querying XML data by the nested relational sequence database system

    Publication Year: 2003, Page(s):236 - 241
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (270 KB) | HTML iconHTML

    In this paper, we present the nested relational sequence model (NRSM), which is an extension of the nested relational data model in order to handle XML data. We also introduce a set of algebraic operations pertaining to the nested relational sequence model in order to handle XML data, to manipulate XML documents via NRS relations. We demonstrate NRS operations by examples and illustrate how XML qu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient subsequence matching for sequences databases under time warping

    Publication Year: 2003, Page(s):139 - 148
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (341 KB) | HTML iconHTML

    It has been found that the technique of searching for similar patterns among time series data is very important in a wide range of scientific and business applications. Most of the research works use Euclidean distance as their similarity metric. However, dynamic time warping (DTW) is a more robust distance measure than Euclidean distance in many situations, where sequences may have different leng... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic data management for location based services in mobile environments

    Publication Year: 2003, Page(s):180 - 189
    Cited by:  Papers (9)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB) | HTML iconHTML

    We characterize the dynamic data management problem for location based services (LBS) in mobile environments and devise a cost model for servicing both location independent and location dependent data. The cost analysis leads to a set of dynamic data management strategies that employs judicious caching, proactive server pushing and neighborhood replication to reduce service cost and improve respon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Expressing database transactions as atomic-operations

    Publication Year: 2003, Page(s):320 - 328
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (763 KB) | HTML iconHTML

    DBMS are widely used and successfully applied to a huge range of applications. However the transaction paradigm that is, with variations like nested transactions and workflow systems, the basis for durability and correctness is poorly suited to many modern applications. Transactions do not scale well and behave poorly at high concurrency levels and in distributed systems. The atomic-operations mod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective schema-based XML query optimization techniques

    Publication Year: 2003, Page(s):230 - 235
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (367 KB) | HTML iconHTML

    Use of path expressions is a common feature in most XML query languages, and many evaluation methods for path expression queries have been proposed recently. However, there are few researches on the issue of optimizing regular path expression queries. In this paper, two kinds of path expression optimization principles are proposed, named path shortening and path complementing, respectively. The pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A stream segregation algorithm for polyphonic music databases

    Publication Year: 2003, Page(s):130 - 138
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (359 KB) | HTML iconHTML

    Most of the existing algorithms for music information retrieval are based on string matching. However, some searching results are perceptually insignificant in the sense that they cannot really be heard, owing to negligence of how people perceive music. When listening to music, it is perceived in groupings of musical notes called streams. Stream-crossing musical patterns are perceptually insignifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancements on local outlier detection

    Publication Year: 2003, Page(s):298 - 307
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB) | HTML iconHTML

    Outliers, commonly referred to as exceptional cases, exist in many real-world databases. Detection of such outliers is important for many applications. In this paper, we focus on the density-based notion that discovers local outliers by means of the local outlier factor (LOF) formulation. Three enhancement schemes over LOF are introduced, namely LOF' and LOF" and GridLOF. Thorough explanation and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficiently mining maximal frequent sets for discovering association rules

    Publication Year: 2003, Page(s):104 - 110
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (242 KB) | HTML iconHTML

    We present Metamorphosis, an algorithm for mining maximal frequent sets (MFS) using data transformations. Metamorphosis efficiently transforms the dataset to maximum collapsible and compressible (MC2) format and employs a top down strategy with phased bottom up search for mining MFS. Using the chess and connect dataset [benchmark datasets created by Univ. of California, Irvine], we demonstrate tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pushing quality of service information and requirements into global query optimization

    Publication Year: 2003, Page(s):170 - 179
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (313 KB) | HTML iconHTML

    In recent years, a lot of research effort has been dedicated to the management of quality of service (QoS), mainly in the fields of telecommunication networks and multimedia systems. Emerging applications such as electronic commerce, health-care applications, digital publishing or data mining also have requirements regarding the quality of service, the cost of service, the quality of data to be de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating nested queries on XML data

    Publication Year: 2003, Page(s):224 - 229
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (247 KB) | HTML iconHTML

    In the past few years, much attention has been paid to the study of semistructured data, i.e., data with irregular, possibly unstable, and rapidly changing structure, and, in particular, to the study of their best-known incarnation: XML. The growing interest toward XML leaded to the definition of many querying and manipulating tools, such as the standard query language XQuery (Boag et al., 2002). ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification of malicious transactions in database systems

    Publication Year: 2003, Page(s):329 - 335
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (242 KB) | HTML iconHTML

    Existing host-based intrusion detection systems (IDSs) use the operating system log or the application log to detect misuse or anomaly activities. These methods are not sufficient for detecting intrusion in database systems. In this paper, we describe a method for database intrusion detection by using data dependency relationships. Typically before a data item is updated in the database some other... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification of clusters in the Web graph based on link topology

    Publication Year: 2003, Page(s):123 - 128
    Cited by:  Papers (1)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (267 KB) | HTML iconHTML

    The Web graph has recently been used to model the link structure of the Web. The studies of such graphs can yield valuable insights into Web algorithms for crawling, searching and discovery of Web communities. This paper proposes a new approach to clustering the Web graph. The proposed algorithm identifies a small subset of the graph as "core" members of clusters, and then incrementally constructs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bitmap techniques for optimizing decision support queries and association rule algorithms

    Publication Year: 2003, Page(s):34 - 43
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB) | HTML iconHTML

    In this paper, we discuss some new bitmap techniques for optimizing decision support queries and association rule algorithm. We first show how to use a new type of predefined bitmap join index (prejoin_bitmap_index) to efficiently execute complex decision support queries with multiple outer join operations involved and push the outer join operations from the data flow level to the bitmap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying bulk insertion techniques for dynamic reverse nearest neighbor problems

    Publication Year: 2003, Page(s):290 - 297
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (249 KB) | HTML iconHTML

    Reverse nearest neighbors queries have emerged as an important class of queries for spatial and other types of databases. The Rdnn-tree is an R-tree based structure that has been shown to perform outstandingly for such kind of queries. However, one practical problem facing it (as well as other type of indexes) is how to effectively construct the index from stretch. In this case, the cost of constr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Issues in object-based notification

    Publication Year: 2003, Page(s):398 - 402
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (221 KB) | HTML iconHTML

    Integrating notification with shared memory applications is an interesting problem. This paper looks at implementing notification in a shared memory, object-oriented, distributed transaction environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frequent itemsets mining for database auto-administration

    Publication Year: 2003, Page(s):98 - 103
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (243 KB) | HTML iconHTML

    With the wide development of databases in general and data warehouses in particular, it is important to reduce the tasks that a database administrator must perform manually. The aim of auto-administrative systems is to administrate and adapt themselves automatically without loss (or even with a gain) in performance. The idea of using data mining techniques to extract useful knowledge for administr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing views for light-weight Web ontologies

    Publication Year: 2003, Page(s):160 - 169
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (361 KB) | HTML iconHTML

    The Semantic Web aims at easy integration and usage of content by building on a semi-structured data model where data semantics are explicitly specified through ontologies. The use of ontologies in real-world applications such as community portals has shown that a new level of data independence is required for ontology-based applications. For example, the customization of information towards the n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preferred repairs for inconsistent databases

    Publication Year: 2003, Page(s):202 - 211
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (527 KB) | HTML iconHTML

    The objective of this paper is to investigate the problems related to the extensional integration of information sources. In particular, we propose an approach for managing inconsistent databases, i.e. databases violating integrity constraints. The presence of inconsistent data can be resolved by "repairing" the database, i.e. by providing a computational mechanism that ensures obtaining consisten... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • E-learning as a Web service (extended abstract)

    Publication Year: 2003, Page(s):242 - 249
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (569 KB) | HTML iconHTML

    E-learning has been a topic of increasing interest in recent years. It is often perceived as a group effort, where content authors, instructional designers, multimedia technicians, teachers, trainers, database administrators, and people from various other areas of expertise come together in order to serve a community of learners. In a typical e-learning scenario, many of the activities can be perc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An empirical study of commutativity in application code

    Publication Year: 2003, Page(s):361 - 369
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (234 KB) | HTML iconHTML

    A typical object database manages concurrency control by instance locking, based on the identification of instance operations as "read" or "write". An alternative theory shows that additional concurrency can be obtained based on operation commutativity. Under commutativity theory, activities can be allowed concurrently as long as they commute, that is, the effect is the same in either order. In th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model for schema integration in heterogeneous databases

    Publication Year: 2003, Page(s):2 - 11
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (722 KB)

    Schema integration is the process by which schemata from heterogeneous databases are conceptually integrated into a single cohesive schema. In this work we propose a modeling framework for schema integration, capturing the inherent uncertainty accompanying the integration process. The model utilizes a fuzzy framework to express a confidence measure, associated with the outcome of a schema integrat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.