Sciweavers

190 search results - page 4 / 38
» Discovering XML keys and foreign keys in queries
Sort
View
JIDM
2010
155views more  JIDM 2010»
13 years 4 months ago
DeweyIDs - The Key to Fine-Grained Management of XML Documents
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...
Michael Peter Haustein, Theo Härder, Christia...
ICDE
2007
IEEE
127views Database» more  ICDE 2007»
14 years 7 months ago
Efficiently Detecting Inclusion Dependencies
Data sources for data integration often come with spurious schema definitions such as undefined foreign key constraints. Such metadata are important for querying the database and ...
Jana Bauckmann, Ulf Leser, Felix Naumann, Veroniqu...
BNCOD
2004
397views Database» more  BNCOD 2004»
13 years 7 months ago
DbSurfer: A Search and Navigation Tool for Relational Databases
Abstract. We present a new application for keyword search within relational databases, which uses a novel algorithm to solve the join discovery problem by finding Memex-like trails...
Richard Wheeldon, Mark Levene, Kevin Keenoy
ICDE
2009
IEEE
126views Database» more  ICDE 2009»
14 years 1 months ago
Querying Communities in Relational Databases
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speciï¬...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 6 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...