Sciweavers

157 search results - page 15 / 32
» On indexing error-tolerant set containment
Sort
View
NGITS
1997
Springer
13 years 12 months ago
Faster Joins, Self Joins and Multi-Way Joins Using Join Indices
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross....
Hui Lei, Kenneth A. Ross
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
14 years 9 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe
ICDAR
2003
IEEE
14 years 1 months ago
Features for Word Spotting in Historical Manuscripts
For the transition from traditional to digital libraries, the large number of handwritten manuscripts that exist pose a great challenge. Easy access to such collections requires a...
Toni M. Rath, R. Manmatha
DBPL
1993
Springer
95views Database» more  DBPL 1993»
13 years 11 months ago
A Moose and a Fox Can Aid Scientists with Data Management Problems
Fox Finding Objects of eXperiments is the declarative query language for Moose Modeling Objects Of Scienti c Experiments, an object-oriented data model at the core of a scient...
Janet L. Wiener, Yannis E. Ioannidis
DAM
2010
95views more  DAM 2010»
13 years 7 months ago
Excessive factorizations of bipartite multigraphs
Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2...
David Cariolaro, Romeo Rizzi