Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleApril 2006
AutoGlobe: An Automatic Administration Concept for Service-Oriented Database Applications
Future database application systems will be designed as Service Oriented Architectures (SOAs) like SAP's NetWeaver instead of monolithic software systems such as SAP's R/3. The decomposition in finer-grained services allows the usage of hardware ...
- ArticleApril 2006
Integrating Unstructured Data into Relational Databases
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 29https://doi.org/10.1109/ICDE.2006.83In this paper we present a system for automatically integrating unstructured text into a multi-relational database using state-of-the-art statistical models for structure extraction and matching. We show how to extend current highperforming models, ...
- ArticleApril 2006
Indexing for Dynamic Abstract Regions
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 12https://doi.org/10.1109/ICDE.2006.81We propose a new main memory index structure for abstract regions (objects) which may heavily overlap, the RCtree. These objects are "dynamic" and may have short life spans. The novelty is that rather than representing an object by its minimum bounding ...
- ArticleApril 2006
A Partition-Based Approach to Graph Mining
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 74https://doi.org/10.1109/ICDE.2006.7Existing graph mining algorithms typically assume that databases are relatively static and can fit into the main memory. Mining of subgraphs in a dynamic environment is currently beyond the scope of these algorithms. To bridge this gap, we first ...
- ArticleApril 2006
End-biased Samples for Join Cardinality Estimation
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 20https://doi.org/10.1109/ICDE.2006.61We present a new technique for using samples to estimate join cardinalities. This technique, which we term "end-biased samples," is inspired by recent work in network traffic measurement. It improves on random samples by using coordinated pseudo-random ...
-
- ArticleApril 2006
Dual Labeling: Answering Graph Reachability Queries in Constant Time
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 75https://doi.org/10.1109/ICDE.2006.53Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many applications involve huge graphs and require fast answering of reachability ...
- ArticleApril 2006
Designing and Evaluating an XPath Dialect for Linguistic Queries
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 52https://doi.org/10.1109/ICDE.2006.48Linguistic research and natural language processing employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural choices for linguistic data and queries. However, several important ...
- ArticleApril 2006
Clean Answers over Dirty Databases: A Probabilistic Approach
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 30https://doi.org/10.1109/ICDE.2006.35The detection of duplicate tuples, corresponding to the same real-world entity, is an important task in data integration and cleaning. While many techniques exist to identify such tuples, the merging or elimination of duplicates can be a difficult task ...
- ArticleApril 2006
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 73https://doi.org/10.1109/ICDE.2006.34Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the frequent subgraphs with a certain topology is of special interest. Thus, the ...
- ArticleApril 2006
Better Burst Detection
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 146https://doi.org/10.1109/ICDE.2006.30A burst is a large number of events occurring within a certain time window. Many data stream applications require the detection of bursts across a variety of window sizes. For example, stock traders may be interested in bursts having to do with ...
- ArticleApril 2006
Approximating Aggregation Queries in Peer-to-Peer Networks
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 42https://doi.org/10.1109/ICDE.2006.23Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scale, ad-hoc analysis queries ― e.g., aggregation queries ― on these ...
- ArticleApril 2006
Answering Imprecise Queries over Autonomous Web Databases
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 45https://doi.org/10.1109/ICDE.2006.20Current approaches for answering queries with imprecise constraints require user-specific distance metrics and importance measures for attributes of interest - metrics that are hard to elicit from lay users. We present AIMQ, a domain and user ...
- ArticleApril 2006
Working Models for Uncertain Data
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 7https://doi.org/10.1109/ICDE.2006.174This paper explores an inherent tension in modeling and querying uncertain data: simple, intuitive representations of uncertain data capture many application requirements, but these representations are generally incomplete―standard operations over the ...
- ArticleApril 2006
WebIQ: Learning from the Web to Match Deep-Web Query Interfaces
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 44https://doi.org/10.1109/ICDE.2006.172Integrating Deep Web sources requires highly accurate semantic matches between the attributes of the source query interfaces. These matches are usually established by comparing the similarities of the attributes' labels and instances. However, ...
- ArticleApril 2006
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 9https://doi.org/10.1109/ICDE.2006.159In applications of biometric databases the typical task is to identify individuals according to features which are not exactly known. Reasons for this inexactness are varying measuring techniques or environmental circumstances. Since these circumstances ...
- ArticleApril 2006
Syntactic Rule Based Approach toWeb Service Composition
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 31https://doi.org/10.1109/ICDE.2006.153This paper studies a problem of web service composition from a syntactic approach. In contrast with other approaches on enriched semantic description such as statetransition description of web services, our focus is in the case when only the input-...
- ArticleApril 2006
Simultaneous Pipelining in QPipe: Exploiting Work Sharing Opportunities Across Queries
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 162https://doi.org/10.1109/ICDE.2006.138Data warehousing and scientific database applications operate on massive datasets and are characterized by complex queries accessing large portions of the database. Concurrent queries often exhibit high data and computation overlap, e.g., they access ...
- ArticleApril 2006
Searching Substructures with Superimposed Distance
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 88https://doi.org/10.1109/ICDE.2006.136Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structures with categorical or geometric distance constraints is not solved yet. ...
- ArticleApril 2006
Reasoning About Approximate Match Query Results
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 8https://doi.org/10.1109/ICDE.2006.128Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such operations and some have been embedded in a declarative data cleaning ...
- ArticleApril 2006
Précis: The Essence of a Query Answer
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 69https://doi.org/10.1109/ICDE.2006.114Wide spread use of database systems in modern society has brought the need to provide inexperienced users with the ability to easily search a database with no specific knowledge of a query language. Several recent research efforts have focused on ...