Proceedings 14th International Conference on Scientific and Statistical Database Management
SCOPUS
1099-3371
Cơ quản chủ quản: N/A
Các bài báo tiêu biểu
Efficient techniques for range search queries on earth science data
- Trang 142-151
We consider the problem of organizing large scale earth science raster data to
efficiently handle queries for identifying regions whose parameters fall within
certain range values specified by the queries. This problem seems to be critical
to enabling basic data mining tasks such as determining associations between
physical phenomena and spatial factors, detecting changes and trends, and
content b...
#Geoscience #Large-scale systems #Data mining #Information retrieval #Content based retrieval #Data structures #Computational modeling #Educational institutions #Organizing #Tree data structures
Query processing with description logic ontologies over object-wrapped databases
- Trang 27-36
This paper presents an approach to answering queries over an ontology modelled
using a description logic. The ontology acts as a global schema, providing a
declarative description of the concepts of the domain, the instances of which
are stored in (potentially many) object-wrapped sources. Queries are expressed
using terms from the rich vocabulary of the ontology, and are translated into an
equiva...
#Query processing #Logic #Ontologies #Proposals #Bioinformatics #Calculus #Spatial databases #Object oriented modeling #Algebra #Computer science
Joint queries estimation from multiple OLAP databases
- Trang 241
Given an OLAP query expressed over a collection of source OLAP databases, we
study the problem of computing the result OLAP target database when the
underlying detail data of the source databases are not available. The problem
arises when the source databases do not have the same category attributes, and
it is not possible to derive the result from a single database. The method we
use is the linea...
#Databases #Yield estimation #Cyclotrons #Interpolation #Demography #State estimation
A structure-based search engine for phylogenetic databases
- Trang 7-10
Phylogenetic trees are essential for understanding the relationships among
organisms or taxa. Many of the current techniques for searching phylogenetic
repositories allow the user to perform a keyword-type search or an aligned
sequence data search, or to browse a hierarchical list of taxa. Here we describe
a new search engine that allows the user to present an example phylogeny, or a
query tree, a...
#Search engines #Phylogeny #Databases #Organisms #History #Search methods #Computer science #Web sites #Genetic mutations #Visualization
A negotiation agent for distributed heterogeneous statistical databases
- Trang 207-216
The World-Wide Web provides an ever-increasing source of diverse information. We
focus on query agents, in particular the matching and negotiation agents that
are responsible for pre-integration where the matching agent decomposes the
query into sub-queries, and then searches metadata to find datasets that match
the query fragments. In the case of heterogeneous data, the matching agent
utilises a ...
#Distributed databases #Intelligent agent #Aggregates #Statistics #Distributed computing #Internet #Testing #Runtime #Software agents #Artificial intelligence
Information-theoretic disclosure risk measures in statistical disclosure control of tabular data
- Trang 227-231
Statistical database protection is a part of information security which tries to
prevent published statistical information (tables, individual records) from
disclosing the contribution of specific respondents. This paper shows how to use
information-theoretic concepts to measure disclosure risk for tabular data. The
proposed disclosure risk measure is compatible with a broad class of disclosure
pr...
#Protection #Databases #Information security #Information theory #Statistics #Aggregates #Sampling methods #Statistical distributions #Conference management
Managing heterogeneous ecological data using Morpho
- Trang 69-76
Ecological and environmental data cover a wide range of topics, from
biodiversity surveys to measurements of trace gas fluxes, and are modeled using
a tremendous variety of schemas. We have developed Morpho, a data management
application designed to assist researchers in managing this heterogeneous
collection of ecological data. Our goal in developing Morpho was to ease the
burden of data manageme...
#XML #Network servers #Packaging #Biodiversity #Collaboration #Databases #File servers #Conference management #Knowledge management #Environmental factors
Similarity searching for multi-attribute sequences
- Trang 175-184
We investigate the problem of searching similar multiattribute time sequences.
Such sequences arise naturally in a number of medical, financial, video, weather
forecast, and stock market databases where more than one attribute is of
interest at a time instant. We first solve the simple case in which the distance
is defined as the Euclidean distance. Later we extend it to shift and scale
invariance...
#Weather forecasting #Databases #Discrete Fourier transforms #Stock markets #Economic forecasting #Euclidean distance #Wavelet transforms #Computer science #Mathematics #Indexes
Statistical composites: a transformation-bound representation of statistical datasets
- Trang 217-226
Statistical data processing makes use of data matrices and tables as primary
structures for data representation. Embedding these structures into
processing-relevant context information gives rise to enhanced data structures
linking data and metadata. The paper describes a framework for statistical data
processing utilising metadata computationally.
#Data processing #Joining processes #Databases #Statistics #Decision support systems #Data structures #Independent component analysis #Sampling methods #Production #Algebra
ATreeGrep: approximate searching in unordered trees
- Trang 89-98
An unordered labeled tree is a tree in which each node has a string label and
the parent-child relationship is significant, but the order among siblings is
unimportant. This paper presents an approach to the nearest neighbor search
problem for these trees. Given a database D of unordered labeled trees and a
query tree Q, the goal is to find those trees in D that "approximately" contain
Q. Our appr...
#XML #Computer science #Nearest neighbor searches #Phylogeny #Decision trees #Change detection algorithms #Object oriented databases #Filters #Algorithm design and analysis #Object oriented modeling