Sciweavers

2859 search results - page 249 / 572
» Querying Complex Structured Databases
Sort
View
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
16 years 7 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
16 years 7 months ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain
DASFAA
2003
IEEE
115views Database» more  DASFAA 2003»
15 years 11 months ago
The BofS Solution to Limitations of Approximate Summaries
Data warehouses are of crucial importance to decision-making in competitive organizations. The fact that they store enormous quantities of data is a challenge in what concerns per...
Pedro Furtado, João Pedro Costa
EDBT
2009
ACM
135views Database» more  EDBT 2009»
15 years 11 months ago
Provenance for nested subqueries
Data provenance is essential in applications such as scientific computing, curated databases, and data warehouses. Several systems have been developed that provide provenance fun...
Boris Glavic, Gustavo Alonso
KES
2010
Springer
15 years 5 months ago
Talking Biology in Logic, and Back
While computation of biological information takes center stage in today’s research, knowledge-based query processing in biological databases has not gained much attention. The co...
Hasan Jamil