Sciweavers

348 search results - page 41 / 70
» Database Support for Path Query Functions
Sort
View
GLOBECOM
2008
IEEE
14 years 3 months ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong
HICSS
1996
IEEE
74views Biometrics» more  HICSS 1996»
14 years 24 days ago
Querying Structured Hyperdocuments
In this paper, we present a document model which integrates the logical structure and hypertext link structure of hyperdocuments in order to manage structured documents with hyper...
Yong Kyu Lee, Seong-Joon Yoo, Kyoungro Yoon, P. Br...
VLDB
1999
ACM
136views Database» more  VLDB 1999»
14 years 27 days ago
O-O, What Have They Done to DB2?
In this paper, we describe our recent experiences in adding a number of object-relational extensions to the DB2 Universal Database UDB system as part of a research and developme...
Michael J. Carey, Donald D. Chamberlin, Srinivasa ...
EDBT
2004
ACM
133views Database» more  EDBT 2004»
14 years 8 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum
PVLDB
2010
98views more  PVLDB 2010»
13 years 7 months ago
On-the-Fly Entity-Aware Query Processing in the Presence of Linkage
Entity linkage is central to almost every data integration and data cleaning scenario. Traditional techniques use some computed similarity among data structure to perform merges a...
Ekaterini Ioannou, Wolfgang Nejdl, Claudia Nieder&...