Sciweavers

342 search results - page 48 / 69
» Conjunctive Queries over Trees
Sort
View
VLDB
2001
ACM
94views Database» more  VLDB 2001»
14 years 8 days ago
FeedbackBypass: A New Approach to Interactive Similarity Query Processing
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
Ilaria Bartolini, Paolo Ciaccia, Florian Waas
BIOINFORMATICS
2011
12 years 11 months ago
RINQ: Reference-based Indexing for Network Queries
We consider the problem of similarity queries in biological network databases. Given a database of networks, similarity query returns all the database networks whose similarity (i...
Günhan Gülsoy, Tamer Kahveci
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 8 months ago
An inductive database prototype based on virtual mining views
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
Élisa Fromont, Adriana Prado, Bart Goethals...
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
13 years 9 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
WEBDB
2005
Springer
83views Database» more  WEBDB 2005»
14 years 1 months ago
Indexing for XML Siblings
Efficient querying XML documents is an increasingly important issue considering the fact that XML becomes the de facto standard for data representation and exchange over the Web,...
SungRan Cho