2001 search results - page 270 / 401 » Indexing in a Hypertext Database |
123
click to vote
DIAGRAMS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X1, ..., Xn , n < 9....
130
click to vote
ICDT
2003
ACM
15 years 8 months ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
109
Voted
SSDBM
2010
IEEE
15 years 8 months ago
2010
IEEE
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
133
Voted
ADBIS
2001
Springer
15 years 8 months ago
2001
Springer
Three join algorithms are evaluated in an environment with distributed main-memory based mediators and data sources. A streamed ship-out join ships bulks of tuples to a mediator ne...
126
click to vote
IDEAS
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper considers the issue of bulk loading large data sets for the UB-Tree, a multidimensional index structure. Especially in dataware housing (DW), data mining and OLAP it is...