Sciweavers

2859 search results - page 203 / 572
» Querying Complex Structured Databases
Sort
View
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
15 years 8 months ago
Mining for Tree-Query Associations in a Graph
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
Eveline Hoekx, Jan Van den Bussche
ICDE
2005
IEEE
145views Database» more  ICDE 2005»
15 years 8 months ago
Towards Indexing Schemes for Self-Tuning DBMS
Index tuning as part of database tuning is the task of selecting and creating indexes with the goal of reducing query processing times. However, in dynamic environments with vario...
Kai-Uwe Sattler, Eike Schallehn, Ingolf Geist
DASFAA
2005
IEEE
153views Database» more  DASFAA 2005»
15 years 8 months ago
FASST Mining: Discovering Frequently Changing Semantic Structure from Versions of Unordered XML Documents
Abstract. In this paper, we present a FASST mining approach to extract the frequently changing semantic structures (FASSTs), which are a subset of semantic substructures that chang...
Qiankun Zhao, Sourav S. Bhowmick
ER
2008
Springer
102views Database» more  ER 2008»
15 years 4 months ago
Retrieving Documents with Geographic References Using a Spatial Index Structure Based on Ontologies
Abstract. Both Geographic Information Systems and Information Retrieval have been very active research fields in the last decades. Lately, a new research field called Geographic In...
Miguel Rodríguez Luaces, Ángeles S. ...
ICDT
2007
ACM
107views Database» more  ICDT 2007»
15 years 8 months ago
Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
Michel Leclère, Marie-Laure Mugnier