2859 search results - page 387 / 572 » Querying Complex Structured Databases |
148
click to vote
IJFCS
2002
15 years 2 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
109
click to vote
COMPGEOM
2005
ACM
15 years 4 months ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
107
click to vote
EDBT
2006
ACM
16 years 2 months ago
2006
ACM
In this paper, we describe and situate the TUPELO system for data mapping in relational databases. Automating the discovery of mappings between structured data sources is a long st...
142
Voted
CIKM
2006
Springer
15 years 4 months ago
2006
Springer
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
109
Voted
BMCBI
2006
15 years 2 months ago
2006
Background: Gene function analysis often requires a complex and laborious sequence of laboratory and computer-based experiments. Choosing an effective experimental design generall...