1091 search results - page 19 / 219 » Approximation in Databases |
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
SSDBM
2002
IEEE
14 years 1 months ago
2002
IEEE
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
GCB
2004
Springer
14 years 1 months ago
2004
Springer
: The main contribution of this paper is a novel approach for fast searching in huge structural databases like the PDB. The data structure is based on an adaption of the generalize...
SPIRE
1998
Springer
14 years 20 days ago
1998
Springer
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
DIS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper, we consider 0/1 databases and provide an alternative way of extracting knowledge from such databases using tiles. A tile is a region in the database consis...