bluuebunny/crossref_metadata_2025 huggingface dataset:
The V3 video server--managing analog and digital video clips
Authors: Rakow Thomas C. , Muth Peter
Published: November 2005

The

V
3
Video Server

is a demonstration showing a multimedia application developed on top of the
VODAK
database management system. VODAK is a prototype of an object-oriented and distributed database management system (DBMS) developed at GMD-IPSI. The V
3
Video Server allows a user to interactively store, retrieve, manipulate, and present analog and short digital video clips. A video clip consists of a sequence of pictures and corresponding sound. Several attributes like author, title, and a set of keywords are annotated. The highlights of the demonstration are as follows. (1) It is shown that an object-oriented database management systems is very useful for the development of multimedia applications. (2) The video server gives valuable hints for the development of an object-oriented database management system in direction to a
multimedia database management system
.
Information organization using Rufus
Authors: Luniewski Allen , Schwarz Peter , Shoens Kurt , Stamos Jim , Thomas John
Published: November 2005

Computer system users today are inundated with a flood of semi-structured information, such as documents, electronic mail, programs, and images. Today, this information is typically stored in filesystems that provide limited support for organizing, searching, and operating upon this data, all operations that are vital to the ability of users to effectively use this data. Database systems provide good function for organizing, searching, managing and writing applications on structured data. Current database systems are inappropriate for semi-structured information because moving the data into the database breaks all existing applications that use the data. The Rufus system attacks the problems of semi-structured information by using database function to help users manage semi-structured information without requiring that the user's information reside in the database.
Research perspectives for time series management systems
Authors: Dreyer Werner , Dittrich Angelika Kotz , Schmidt Duri
Published: November 2005

Empirical research based on time series is a data intensive activity that needs a data base management system (DBMS). We investigate the special properties a time series management system (TSMS) should have. We then show that currently available solutions and related research directions are not well suited to handle the existing problems. Therefore, we propose the development of a special purpose TSMS, which will offer particular modeling, retrieval, and computation capabilities. It will be suitable for end users, offer direct manipulation interfaces, and allow data exchange with a variety of data sources, including other databases and application packages. We intend to build such a system on top of an off-the-shelf object-oriented DBMS.
Supporting dynamic displays using active rules
Authors: Díaz Oscar , Jaime Arturo , Paton Norman W. , al-Qaimari Ghassan
Published: November 2005

In a graphical interface which is used to display database objects,
dynamic displays
are updated automatically as modifications occur to the database objects being visualised. Approaches based on enlarging either the database system or the interface code to provide the appropriate communication, complicates the interaction between the two systems, as well as making later updates cumbersome. In this paper, an approach based on active rules is presented. The declarative and modular description of active rules enables active displays to be supported with minimal changes to the database or its graphical interface. Although this approach has been used to support the link between a database system and its graphical interface, it can easily be adapted to support dynamic interaction between an active database system and other external systems.
A consensus glossary of temporal database concepts
Authors: Dyreson Curtis , Grandi Fabio , Käfer Wolfgang , Kline Nick , Lorentzos Nikos , Mitsopoulos Yannis , Montanari Angelo , Nonen Daniel , Peressi Elisa , Pernici Barbara , Roddick John F. , Sarda Nandlal L. , Scalas Maria Rita , Segev Arie , Snodgrass Richard Thomas , Soo Mike D. , Tansel Abdullah , Tiberio Paolo , Wiederhold Gio
Published: November 2005

This document contains definitions of a wide range of concepts specific to and widely used within temporal databases. In addition to providing definitions, the document also includes separate explanations of many of the defined concepts. Two sets of criteria are included. First, all included concepts were required to satisfy four relevance criteria, and, second, the naming of the concepts was resolved using a set of evaluation criteria. The concepts are grouped into three categories: concepts of general database interest, of temporal database interest, and of specialized interest. This document is a digest of a full version of the glossary
1
. In addition to the material included here, the full version includes substantial discussions of the naming of the concepts.The consensus effort that lead to this glossary was initiated in Early 1992. Earlier status documents appeared in March 1993 and December 1992 and included terms proposed after an initial glossary appeared in SIGMOD Record in September 1992. The present glossary subsumes all the previous documents. It was most recently discussed at the "ARPA/NSF International Workshop on an Infrastructure for Temporal Databases," in Arlington, TX, June 1993, and is recommended by a significant part of the temporal database community. The glossary meets a need for creating a higher degree of consensus on the definition and naming of temporal database concepts.
Text databases
Authors: Loeffen Arjan
Published: November 2005

Text models focus on the manipulation of textual data. They describe texts by their structure, operations on the texts, and constraints on both structure and operations. In this article common characteristics of machine readable texts in general are outlined. Subsequently, ten text models are introduced. They are described in terms of the datatypes that they support, and the operations defined by these datatypes. Finally, the models are compared.
Progress on HPCC and NII
Authors: Winslett Marianne
Published: November 2005

In this issue we briefly touch on the continuing turmoil over NSF, ARPA, and HPCC, and the brighter news regarding the US National Information Infrastructure plan. We then describe funding opportunities from NSF, ARPA, the National Security Agency, the National Center for Automated Information Research, the Air Force, and NASA.
Small computers and security
Authors: Vaughan Rayford B. , Angaye Cleopas O.
Published: November 2005

Security of small computing devices networked locally or over long haul networks need not be accomplished without adequate protection of the data being processed. There are adequate commercial products and techniques available today to secure data requiring protection while it is being viewed, processed, stored, or transmitted. The key to protection in such environments is risk assessment, proper integration of protection mechanisms, and assurance of protection.
Cryptography for PC/workstation security
Authors: Harn Lein , Lin Hung-Yu , Xu Yongnan
Published: November 2005

Current PC security tools were designed primarily for stand-alone systems. Distributed systems, in which multiple PC users access multiple resources over interconnected networks (LANs, WANs, etc.), is the current trend of applications. The already difficult job of securing the PC is getting even more difficult. With recent advancement of cryptographic research, cryptography did more than just manipulates data to turn meaningful message into nonsense to provide data security. Cryptography can also provide solutions for many different applications. In this paper, security problems for PC/workstation will be briefly discussed. Then we will address those cryptographic applications for PCs.
Inferential security in individual computing environments
Authors: Angaye Cleopas O. , Hansen Steven C.
Published: November 2005

Inference is a powerful act of the mind that combines known data using human judgement in such a way as to extend knowledge, i.e., creation of new information. People can use the information stored in a computer or the behavior of the computer to gain knowledge for which they have no authorization. This is considered a security or confidentiality breach and is the subject of the area of computer security known as inferential security. This paper provides an overview of inferential security breach and some of the known closed form methods for perpetrating this type of security breach. Some of the concerns for the user of individual computing environments (ICE's) are addressed.
Security for individual computing environments
Authors: Unger Elizabeth A.
Published: November 2005

This issue of the
SIGICE Bulletin
has a focus of those aspects of security called
secrecy
and
availability.
Many of us, like the authors of one of the articles, asks the question, "Is security for PC's and workstations an oxymoron?" Individual Computing Environments (ICE), i.e., PC's, workstations, etc. often appear to most of us as being extremely vulnerable to a variety of secrecy and availability breaches with little one can do about the problems. What you will learn from the articles presented in this volume is that despite the vulnerability, these machines can be secured to the point of reducing the risk to a level one is willing to tolerate. The solutions suggested go beyond the commonly used virus detection and elimination software. I urge all who own or use individual computing environments on which data and programs reside to read this series of articles.
Response to the ODMG-93 commentary written by Dr. Won Kim of UniSQL, Inc.
Authors: Object Database Management Group CORPORATE
Published: November 2005

In the March 1994 issue of the ACM SIGMOD Record, Dr. Won Kim of UniSQL and the SIGMOD Chairperson published “Observations on the ODMG-93 Proposal for Object-Oriented Database Language” (Volume 23, Number 1).

This commentary contained some useful technical contributions. We thank Dr. Kim for that. Nevertheless, it also contained a number of inaccuracies and misleading statements that we, the ODMG, would like to set straight.
Research issues in databases for ARCS
Authors: Datta Anindya
Published: November 2005

We identify an emergent class of database systems that has not been dealt with extensively in the literature that we call ARCS (Active, Rapidly Changing data Systems) databases. These systems impose certain unique requirements on databases that monitor and control them. These requirements are such that traditional data and transaction management models appear inadequate. We present an analysis of data and transaction characteristics in ARCS systems and identify relevant research issues.
Metadata for multimedia documents
Authors: Böhm Klemens , Rakow Thomas C.
Published: November 2005

In this article metadata for mulimedia documents are classified in conformity with their nature, and the different kinds of metadata are brought into relation with the different purposes intended. We describe how metadata may be organized in accordance with the ISO standards SGML, which facilitates the handling of structured documents, and DFR, which supports the storage of collections of documents. Finally, we outline the impact of our observations on future developments.
A metadatabase system for semantic image search by a mathematical model of meaning
Authors: Kiyoki Yasushi , Kitagawa Takashi , Hayama Takanari
Published: November 2005

In the design of multimedia database systems, one of the most important issues is to extract images dynamically according to the user's impression and the image's contents. In this paper, we present a metadatabase system which realizes the semantic associative search for images by giving keywords representing the user's impression and the image's contents.This metadatabase system provides several functions for performing the semantic associative search for images by using the metadata representing the features of images. These functions are realized by using our proposed mathematical model of meaning. The mathematical model of meaning is extended to compute specific meanings of keywords which are used for retrieving images unambiguously and dynamically. The main feature of this model is that the semantic associative search is performed in the orthogonal semantic space. This space is created for dynamically computing semantic equivalence or similarity between the metadata items of the images and keywords.
Sequoia 2000 metadata schema for satellite images
Authors: Anderson Jean T. , Stonebraker Michael
Published: November 2005

Sequoia 2000 schema development is based on emerging geospatial standards to accelerate development and facilitate data exchange. This paper focuses on the metadata schema for digital satellite images. We examine how satellite metadata are defined, used, and maintained. We discuss the geospatial standards we are using, and describe a SQL prototype that is based on the Spatial Archive and Interchange Format (SAIF) standard and implemented in the Illustra object-relational database.
Using metadata for the intelligent browsing of structured media objects
Authors: Grosky William I. , Fotouhi Farshad , Sethi Ishwar K. , Capatina Bogdan
Published: November 2005

Interacting with a multimedia information system is different from interacting with a standard text-based information system. In this paper, we present the design of a system called
Content-Based Hypermedia (CBH)
, which allows a user to utilize metadata to intelligently browse through a collection of media objects. We describe the approach we use to model data in order to make it browsable, explore our approach to browsing, which we call
metadata mediated browsing
, indicate how metadata is used in the concept of
similarity
, present the architecture of our system, and discuss indexing techniques for similarity browsing using content-based metadata and approaches to clustering which generate higher-level metadata to help the user browse more effectively.
Metadata for integrating speech documents in a text retrieval system
Authors: Glavitsch Ulrike , Schäuble Peter , Wechsler Martin
Published: November 2005

We present an information retrieval system that simultaneously allows to search for text and speech documents. The retrieval system accepts vague queries and performs a best-match search to find those documents that are relevant to the query. The output of the retrieval system is a list of ranked documents where the documents on the top of the list satisfy best the user's information need. The relevance of the documents is estimated by means of metadata (document description vectors). The metadata is automatically generated and it is organized such that queries can be processed efficiently. We introduce a controlled indexing vocabulary for both speech and text documents. The size of the new indexing vocabulary is small (1000 features) compared with the sizes of indexing vocabularies of conventional text retrieval (10000 - 100000 features). We show that the retrieval effectiveness based on such a small indexing vocabulary is similar to the retrieval effectiveness of a Boolean retrieval system.
Sleepers and workaholics
Authors: Barbará Daniel , Imieliński Tomasz
Published: November 2005

In the mobile wireless computing environment of the future a large number of users equipped with low powered palm-top machines will query databases over the wireless communication channels. Palmtop based units will often be disconnected for prolonged periods of time due to the battery power saving measures; palmtops will also frequencly relocate between different cells and connect to different data servers at different times. Caching of frequently accessed data items will be an important technique that will reduce contention on the narrow bandwidth wireless channel. However, cache invalidation strategies will be severely affected by the disconnection and mobility of the clients. The server may no longer know which clients are currently residing under its cell and which of them are currently on. We propose a taxonomy of different cache invalidation strategies and study the impact of client's disconnection times on their performance. We determine that for the units which are often disconnected (sleepers) the best cache invalidation strategy is based on signatures previously used for efficient file comparison. On the other hand, for units which are connected most of the time (workaholics), the best cache invalidation strategy is based on the periodic broadcast of changed data items.
Energy efficient indexing on air
Authors: Imielinski Tomasz , Viswanathan S. , Badrinath B. R.
Published: November 2005

We consider wireless broadcasting of data as a way of disseminating information to a massive number of users. Organizing and accessing information on wireless communication channels is different from the problem of organizing and accessing data on the disk. We describe two methods, (1,
m
)
Indexing
and
Distributed Indexing
, for organizing and accessing broadcast data. We demonstrate that the proposed algorithms lead to significant improvement of battery life, while retaining a low access time.
SIGMOD challenges paper
Authors: Ahn Ilsoo
Published: November 2005

Various types of computer systems are used behind the scenes in many parts of the telecommunications network to ensure its efficient and trouble-free operation. These systems are large, complex, and expensive real-time computer systems that are mission critical, and contains a database engine as a critical component. These systems share some of common database issues with conventional applications, but they also exhibit rather unique characteristics that present challenging database issues. Major DBMS issues for network management include choosing the right data model, handling two different kinds of data in terms of integrity and recovery constraints, supporting temporal queries, satisfying real-time performance and high availability requirements, and several miscellaneous issues. Some of these issues have been investigated in various areas of database researches, but most of them largely remain in the research stage. Advances in these areas that result in actual integrated implementations for data-intensive, real-time and temporal applications are eagerly awaited.
Staggered striping in multimedia information systems
Authors: Berson Steven , Ghandeharizadeh Shahram , Muntz Richard , Ju Xiangyu
Published: November 2005

Multimedia information systems have emerged as an essential component of many application domains ranging from library information systems to entertainment technology. However, most implementations of these systems cannot support the continuous display of multimedia objects and suffer from frequent disruptions and delays termed
hiccups
. This is due to the low I/O bandwidth of the current disk technology, the high bandwidth requirement of multimedia objects, and the large size of these objects that almost always requires them to be disk resident. One approach to resolve this limitation is to decluster a multimedia object across multiple disk drives in order to employ the aggregate bandwidth of several disks to support the continuous retrieval (and display) of objects. This paper describes staggered striping as a novel technique to provide effective support for multiple users accessing the different objects in the database. Detailed simulations confirm the superiority of staggered striping.
Incomplete path expressions and their disambiguation
Authors: Ioannidis Yannis E. , Lashkari Yezdi
Published: November 2005

When we, humans, talk to each other we have no trouble disambiguating what another person means, although our statements are almost never meticulously specified down to very last detail. We “fill in the gaps” using our common-sense knowledge about the world. We present a powerful mechanism that allows users of object-oriented database systems to specify certain types of ad-hoc queries in a manner closer to the way we pose questions to each other. Specifically, the system accepts as input queries with incomplete, and therefore ambiguous, path expressions. From them, it generates queries with fully-specified path expressions that are consistent with those given as input and capture what the user most likely meant by them. This is achieved by mapping the problem of path expression disambiguation to an optimal path computation (in the transitive closure sense) over a directed graph that represents the schema. Our method works by exploiting the semantics of the kinds of relationships in the schema and requires no special knowledge about the contents of the underlying database, i.e., it is domain independent. In a limited set of experiments with human subjects, the proposed mechanism was very successful in disambiguating incomplete path expressions.
Optimization of dynamic query evaluation plans
Authors: Cole Richard L. , Graefe Goetz
Published: November 2005

Traditional query optimizers assume accurate knowledge of run-time parameters such as selectivities and resource availability during plan optimization, i.e., at compile time. In reality, however, this assumption is often not justified. Therefore, the “static” plans produced by traditional optimizers may not be optimal for many of their actual run-time invocations. Instead, we propose a novel optimization model that assigns the bulk of the optimization effort to compile-time and delays carefully selected optimization decisions until run-time. Our previous work defined the run-time primitives, “dynamic plans” using “choose-plan” operators, for executing such delayed decisions, but did not solve the problem of constructing dynamic plans at compile-time. The present paper introduces techniques that solve this problem. Experience with a working prototype optimizer demonstrates (i) that the additional optimization and start-up overhead of dynamic plans compared to static plans is dominated by their advantage at run-time, (ii) that dynamic plans are as robust as the “brute-force” remedy of run-time optimization, i.e., dynamic plans maintain their optimality even if parameters change between compile-time and run-time, and (iii) that the start-up overhead of dynamic plans is significantly less than the time required for complete optimization at run-time. In other words, our proposed techniques are superior to both techniques considered to-date, namely compile-time optimization into a single static plan as well as run-time optimization. Finally, we believe that the concepts and technology described can be transferred to commercial query optimizers in order to improve the performance of embedded queries with host variables in the query predicate and to adapt to run-time system loads unpredictable at compile time.
Estimating page fetches for index scans with finite LRU buffers
Authors: Swami Arun , Schiefer K. Bernhard
Published: November 2005

We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches for an index scan when given the number of tuples selected and the number of LRU buffers currently available. The algorithm has an initial phase that is performed exactly once before any estimates are calculated. This initial phase, involving LRU buffer modeling, requires a scan of all the index entries and calculates the number of page fetches for different buffer sizes. An approximate empirical model is obtained from this data. Subsequently, an inexpensive estimation procedure is called by the query optimizer whenever it needs an estimate of the page fetches for the index scan. This procedure utilizes the empirical model obtained in the initial phase.
Spatial joins using seeded trees
Authors: Lo Ming-Ling , Ravishankar Chinya V.
Published: November 2005

Existing methods for spatial joins assume the existence of indices for the participating data sets. This assumption is not realistic for applications involving multiple map layer overlays or for queries involving non-spatial selections. In this paper, we explore a spatial join method that dynamically constructs index trees called
seeded trees
at join time. This methods uses knowledge of the data sets involved in the join process.

Seeded trees are R-tree like structures, and are divided into the
seed levels
and the
grown levels
. The nodes in the seed levels are used to guide tree growth during tree construction. The seed levels can also be used to filter out some input data during construction, thereby reducing tree size. We develop a technique that uses intermediate linked lists during tree construction and significantly speeds up the tree construction process. The technique allows a large number of random disk accesses during tree construction to be replaced by smaller numbers of sequential accesses.

Our performance studies show that spatial joins using seeded trees outperform those using other methods significantly in terms of disk I/O. The CPU penalties incurred are also lower except when seed-level filtering is used.
Managing memory for real-time queries
Authors: Pang Hwee Hwa , Carey Michael J. , Livny Miron
Published: November 2005

The demanding performance objectives that real-time database systems (RTDBS) face necessitate the use of priority resource scheduling. This paper introduces a
Priority Memory Management
(PMM) algorithm that is designed to schedule queries in RTDBS. PMM attempts to minimize the number of missed deadlines by adapting both its multiprogramming level and its memory allocation strategy to the characteristics of the offered workload. A series of simulation experiments confirms that PMM's admission control and memory allocation mechanisms are very effective for real-time query scheduling.
Quickly generating billion-record synthetic databases
Authors: Gray Jim , Sundaresan Prakash , Englert Susanne , Baclawski Ken , Weinberger Peter J.
Published: November 2005

Evaluating database system performance often requires generating synthetic databases—ones having certain statistical properties but filled with dummy information. When evaluating different database designs, it is often necessary to generate several databases and evaluate each design. As database sizes grow to terabytes, generation often takes longer than evaluation. This paper presents several database generation techniques. In particular it discusses: (1) Parallelism to get generation speedup and scaleup. (2) Congruential generators to get dense unique uniform distributions. (3) Special-case discrete logarithms to generate indices concurrent to the base table generation. (4) Modification of (2) to get exponential, normal, and self-similar distributions.

The discussion is in terms of generating billion-record SQL databases using C programs running on a shared-nothing computer system consisting of a hundred processors, with a thousand discs. The ideas apply to smaller databases, but large databases present the more difficult problems.
Practical predicate placement
Authors: Hellerstein Joseph M.
Published: November 2005

Recent work in query optimization has addressed the issue of placing expensive predicates in a query plan. In this paper we explore the predicate placement options considered in the Montage DBMS, presenting a family of algorithms that form successively more complex and effective optimization solutions. Through analysis and performance measurements of Montage SQL queries, we classify queries and highlight the simplest solution that will optimize each class correctly. We demonstrate limitations of previously published algorithms, and discuss the challenges and feasibility of implementing the various algorithms in a commercial-grade system.
Optimizing disjunctive queries with expensive predicates
Authors: Kemper A. , Moerkotte G. , Peithner K. , Steinbrunn M.
Published: November 2005

In this work, we propose and assess a technique called
bypass processing
for optimizing the evaluation of disjunctive queries with expensive predicates. The technique is particularly useful for optimizing selection predicates that contain terms whose evaluation costs vary tremendously; e.g., the evaluation of a nested subquery or the invocation of a user-defined function in an object-oriented or extended relational model may be orders of magnitude more expensive than an attribute access (and comparison). The idea of bypass processing consists of avoiding the evaluation of such expensive terms whenever the outcome of the entire selection predicate can already be induced by testing other, less expensive terms. In order to validate the viability of bypass evaluation, we extend a previously developed optimizer architecture and incorporate three alternative optimization algorithms for generating bypass processing plans.
Partition selection policies in object database garbage collection
Authors: Cook Jonathan E. , Wolf Alexander L. , Zorn Benjamin G.
Published: November 2005

The automatic reclamation of storage for unreferenced objects is very important in object databases. Existing language system algorithms for automatic storage reclamation have been shown to be inappropriate. In this paper, we investigate methods to improve the performance of algorithms for automatic for automatic storage reclamation of object databases. These algorithms are based on a technique called
partitioned garbage collection
, in which a subset of the entire database is collected independently of the rest. Specifically, we investigate the policy that is used to select what partition in the database should be collected. The policies that we propose and investigate are based on the intuition that the values of overwritten pointers provide good hints about where to find garbage. Using trace-driven simulation, we show that one of our policies requires less I/O to collect more garbage than any existing implementable policy and performs close to a near-optimal policy over a wide range of database sizes and object connectivities.
QuickStore
Authors: White Seth J. , DeWitt David J.
Published: November 2005

This paper presents, QuickStore, a memory-mapped storage system for persistent C++ built on top of the EXODUS Storage Manager. QuickStore provides fast access to in-memory objects by allowing application programs to access objects via normal virtual memory pointers. The paper also presents the results of a detailed performance study using the OO7 benchmark. The study compares the performance of QuickStore with the latest implementation of the E programming language. These systems exemplify the two basic approaches (hardware and software) that have been used to implement persistence in object-oriented database systems. Both systems use the same underlying storage manager and compiler allowing us to make a truly apples-to-apples comparison of the hardware and software techniques.
Self-adaptive, on-line reclustering of complex object data
Authors: McIver William J. , King Roger
Published: November 2005

A likely trend in the development of future CAD, CASE and office information systems will be the use of object-oriented database systems to manage their internal data stores. The entities that these applications will retrieve, such as electronic parts and their connections or customer service records, are typically large complex objects composed of many interconnected heterogeneous objects, not thousands of tuples. These applications may exhibit widely shifting usage patterns due to their interactive mode of operation. Such a class of applications would demand clustering methods that are appropriate for clustering large complex objects and that can adapt on-line to the shifting usage patterns. While most object-oriented clustering methods allow grouping of heterogeneous objects, they are usually static and can only be changed off-line. We present one possible architecture for performing complex object reclustering in an on-line manner that is adaptive to changing usage patterns. Our architecture involves the decomposition of a clustering method into concurrently operating components that each handle one of the fundamental tasks involved in reclustering, namely statistics collection, cluster analysis, and reorganization. We present the results of an experiment performed to evaluate its behavior. These results show that the average miss rate for object accesses can be effectively reduced using a combination of rules that we have developed for deciding when cluster analyses and reorganizations should be performed.
Fast subsequence matching in time-series databases
Authors: Faloutsos Christos , Ranganathan M. , Manolopoulos Yannis
Published: November 2005

We present an efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequences into a small set of multidimensional rectangles in feature space. Then, these rectangles can be readily indexed using traditional spatial access methods, like the R*-tree [9]. In more detail, we use a sliding window over the data sequence and extract its features; the result is a trail in feature space. We propose an efficient and effective algorithm to divide such trails into sub-trails, which are subsequently represented by their Minimum Bounding Rectangles (MBRs). We also examine queries of varying lengths, and we show how to handle each case efficiently. We implemented our method and carried out experiments on synthetic and real data (stock price movements). We compared the method to sequential scanning, which is the only obvious competitor. The results were excellent: our method accelerated the search time from 3 times up to 100 times.
Oracle media server
Authors: Laursen Andrew , Olkin Jeffrey , Porter Mark
Published: November 2005

Currently, most data accessed on large servers is structured data stored in traditional databases. Networks are LAN based and clients range from simple terminals to powerful workstations. The user is corporate and the application developer is an MIS professional.

With the introduction of broadband communications to the home and better than 100-to-1 compression techniques, a new form of network-based computing is emerging. Structured data is still important, but the bulk of data becomes unstructured: audio, video, news feeds, etc. The predominant user becomes the consumer. The predominant client device becomes the television set. The application developer becomes the storyboard developer, director, or the video production engineer.

The Oracle Media Server supports access to all types of conventional data stored in Oracle relational and text databases. In addition, we have developed a real-time stream server that supports storage and playback of real-time audio and video data. The Media Server also provides access to data stored in file systems or as binary large objects (images, executables, etc.)

The Oracle Media Server provides a platform for distributed client-server computing and access to data over asymmetric real-time networks. A service mechanism allows applications to be split such that client devices (set-top boxes, personal digital assistants, etc.) can focus on presentation, while backend services running in a distributed server complex, provide access to data via messaging or lightweight RPC (Remote Procedure Call).
Database in crisis and transition
Authors: Vaskevitch David
Published: November 2005

The current paper outlines a number of important changes that face the database community and presents an agenda for how some of these challenges can be met. This database agenda is currently being addressed in the Enterprise Group at Microsoft Corporation. The paper concludes with a scenario for 2001 which reflects the Microsoft vision of “Information at your fingertips.”
MOSAICO—a system for conceptual modeling and rapid prototyping of object-oriented database application
Authors: Missikoff M. , Toiati M.
Published: November 2005

The system Mosaico [MT94] has been conceived to support the design, conceptual modeling, and rapid prototyping of data intensive applications based on Object-Oriented Databases (OODBS). The application is modeled through a graphical user interface and the produced model is encoded in
TQL++
, the design language on which Mosaico is based.
DBLearn
Authors: Han Jiawei , Fu Yongjian , Huang Yue , Cai Yandong , Cercone Nick
Published: November 2005

A prototyped data mining system, DBLearn, has been developed, which efficiently and effectively extracts different kinds of knowledge rules from relational databases. It has the following features: high level learning interfaces, tightly integrated with commercial relational database systems, automatic refinement of concept hierarchies, efficient discovery algorithms and good performance. Substantial extensions of its knowledge discovery power towards knowledge mining in object-oriented, deductive and spatial databases are under research and development.
Grey curve and its general problems
Authors: Liou Jinlu
Published: November 2005

In this paper, we introduce a conception of grey curve according to the grey system theory, define the grey degree of the grey curve, and discuss the basic properties of the grey curve.
On grey relational mapping
Authors: Wang Shuze , Liu Xiqiang
Published: November 2005

This paper discusses the operation of grey relational mapping. We define the equivalent characteristics of relational mapping and the generating relational order. We prove that if the relational mappings are finite, then their maximum, minimum value, weighted average and product function are also relational mappings. The necessary and sufficient condition that two relational mappings are equivalent is that they can be generated by each other by monotonic increasing functions. We put forward the principle of optimum relational order to obtain a better method to carry out the relational analysis.
Determining method for grey relational distinguished coefficient
Authors: Zuo Fengchao
Published: November 2005

According to the thought of information materialism in this paper, the intension of grey information capacity for grey relational distinguished coefficient ζ was dissected. A method for determining grey relational distinguished coefficient ζ was given, which cause the grey relational superior analysis to new levels.
Grey pattern on clinical consultation
Authors: Tan Xuerui , Xu Yuchun
Published: November 2005

With the elementary theory of grey systems, on the basis of whitening function, grey clustering, we try to make a grey pattern of clinical consultation via size of decision weights. This way can better show and concentrate the consultant's view with the lowest bias, directly and objectively. The processes are simple. The results from grey pattern accord with the patient's profits and benefits ironing out the clinical differences between experts.
Book review: The Intemet Quickstart by Mary Ann Spike and Todd Spike (Que 1994)
Authors: Brandes John B. , Coppola Jean F.
Published: November 2005

The reviewers have a positive impression of the book. The material is well organized and presented in a clear fashion without the introduction of undo detail prior to being necessary.
Cyber-surfing
Authors: Berghel Hal
Published: November 2005

Modern network technology has spawned an entirely new cybernetic experience: cyberspace surfing. This surfing is as much a social experience as an information gathering resource. While providing the communication infrastructure for an ever-increasing percentage of the global population, it is also becoming the focal point of an identifiable sub-culture of cybernauts who are attracted to the Internet as moths to light. There is every indication that the forthcoming cyberspace revolution will have an even more dramatic impact on society than the microcomputer revolution.In this paper we analyze the cyber-surfing experience from the point of view of the supportive client-server technologies involved. On the basis of this analysis and some emerging trends we speculate on the future of cyberspace.
IBM MQSeries commercial messaging
Authors: Williams Paul
Published: November 2005

Business organisations are re-engineering,
restructuring and resizing
to become more competitive, or even, to survive. Businesses are transforming themselves into flat, networked organisations and exploring new relationships with customers, suppliers and channels to deliver products and services, a concept which is described as the 'virtual company'. A contracted dynamic work force is also beginning to emerge, one that is tailored to the needs of the business.
PC notes
Authors: Styer Gene
Published: November 2005

Welcome to a new series regarding IBM PC and compatible internals and details about how they operate. This has started as the result of a new class we offered, "Microcomputer Architecture and Software," which was intended to provide background that is both broad and detailed on the insides of a PC for high-school teachers, who will often be expected to be the 'computer wizard' at their respective schools. Because of this unusual combination of breadth and depth, we could not find a single acceptable book, and are relying on a set of reference books and class notes. This series will be based on those class notes.
Surfin on the Net
Authors: McKenna Christopher
Published: November 2005

Not too long ago the internet was an imagery land of ftp sites and gopher servers scattered across the world with no convenient pathway to where anything was. You heard about an ftp or gopher server from a friend or stumbled upon it by accident. Maybe you were impressed to get a piece of mail from a friend in another state or country in seconds after he/she sent it. Maybe you even followed a world wide forum on your favorite topic or application. In this vast land of information, however, nothing was there to tie these services together. Just like everything else in the world, the internet got better and gained another TCP/IP client server tool, the World Wide Web (WWW). A spider net of documents containing images, sounds, binaries, and even movie clips. The internet finally had some backbone and shape to it. It was like a new way of living had emerged over night, I do mean overnight.
Implementation aspects of an object-oriented DBMS
Authors: Dogac Asuman , Altinel Mehmet , Ozkan Cetin , Durusoy Ilker
Published: November 2005

This paper describes the design and implementation of an OODBMS, namely the METU Object-Oriented DBMS (MOOD). MOOD [Dog 94b] is developed on the Exodus Storage Manager (ESM) [ESM 92] and therefore some of the kernel functions like storage management, concurrency control, backup and recovery of data were readily available through ESM. In addition ESM has a client-server architecture and each MOOD process is a client application in ESM. The kernel functions provided by MOOD are the optimization and interpretation of SQL statements, dynamic linking of functions, and catalog management. SQL statements are interpreted whereas functions (which have been previously compiled with C++) within SQL statements are dynamically linked and executed. A query optimizer is implemented by using the Volcano Query Optimizer Generator. A graphical user interface, namely Mood-View [Arp 93a, Arp 93b], is developed using Motif. MoodView displays both the schema information and the query results graphically. Additionally it is possible to update the database schema and to traverse the references in query results graphically.The system is coded in GNU C++ on Sun Sparc 2 workstations. MOOD has a SQL-like object-oriented query language, namely MOODSQL [Ozk 93b, Dog 94c]. MOOD type system is derived from C++, thus eliminating the impedance mismatch between MOOD and C++. The users can also access the MOOD Kernel from their application programs written in C++. For this purpose MOOD Kernel defines a class named UserRequest that contains a method for the execution of MOODSQL statements. The MOOD source code is available both for anonymous ftp users from ftp.cs.wisc.edu and for the WWW users from the site http://www.srdc.metu.edu.tr along with its related documents.In MOOD, each object is given a unique Object Identifier (OID) at object creation time by the ESM which is the disk start address of the object returned by the ESM. Object encapsulation is considered in two parts, method encapsulation and attribute encapsulation. These encapsulation properties are similar to the public and private declarations of C++.Methods can be defined in C++ by users to manipulate user defined classes and after compilation, they are dynamically linked and executed during the interpretation of SQL statements. This late binding facility is essential since database environments enforce run-time modification of schema and objects. With our approach, the interpretation of functions are avoided thus increasing the efficiency of the system. Dynamic linking primitives are implemented by the use of the shared object facility of SunOS [Sun 90]. Overloading is realized by making use of the signature concept of C++.
A close look at the IFO data model
Authors: Hanna Magdy S.
Published: November 2005

The IFO data model was proposed by Abiteboul and Hull [Abiteboul 87] as a formalized semantic database model. It has been claimed by the authors that the model subsumes the Relational model [Codd 70], the Entity-Relationship model [Chen 76], the Functional Data Model [Kerschberg 76] and virtually all of the structured aspects of the Semantic Data Model [Hammer 81], the INSYDE Model [King 85], and the Extended Semantic Hierarchy Model [Brodie 84].This paper examines the IFO data model as presented in [Abiteboul 87], compares it to other models, and thus concludes that the IFO data model is actually a subset of the Semantic Data Model proposed by Hammer in [Hammer 81]. The paper also shows that the IFO data model has failed to support concepts that are essential to both the E-R model and the Semantic Data Model which are claimed to be subsumed by the IFO model.Section 2 discusses the three IFO constructs,
objects, fragments,
and
relationships.
The mapping of these constructs to constructs in the Semantic Data Model is established as an informal proof of the result that the IFO model is subsumed by the SDM.Section 3 lists constructs supported by the Entity-Relationship model [Chen 76, Teorey 86] as will as constructs supported by SDM [Hammer 81]that the IFO data model fails to support.
Multigranularity locking in multiple job classes transaction processing system
Authors: Ng Shan-hoi , Hung Sheung-lun
Published: November 2005

The conditions of when to apply fine and coarse granularity to different kinds of transaction are well understood. However, it is not very clear how multiple job classes using different lock granularities affect each other. This study aims at exploring the impact of multigranularity locking on the performance of multiple job classes transaction processing system which is common in multiuser database system. There are two key findings in the study. Firstly, lock granularity adopted by identical job classes should not differ from each other by a factor of more than 20; otherwise, serious data contention may result. Secondly, short job class transactions are generally benefited when its level of granularity is similar to that of the long job class since this will reduce the additional lock overhead and data contention which are induced by multigranularity locking.
An annotated bibliography of benchmarks for object databases
Authors: Chaudhri Akmal B.
Published: November 2005

This annotated bibliography presents a collection of published papers, technical reports, Master's and PhD Theses that have investigated various aspects of object database performance.