Sciweavers

366 search results - page 44 / 74
» Efficient Query Reformulation in Peer-Data Management System...
Sort
View
ICDE
2006
IEEE
174views Database» more  ICDE 2006»
14 years 9 months ago
Extending RDBMSs To Support Sparse Datasets Using An Interpreted Attribute Storage Format
"Sparse" data, in which relations have many attributes that are null for most tuples, presents a challenge for relational database management systems. If one uses the no...
Jennifer L. Beckmann, Alan Halverson, Rajasekar Kr...
CIKM
2001
Springer
14 years 3 days ago
X007: Applying 007 Benchmark to XML Query Processing Tool
If XML is to play the critical role of the lingua franca for Internet data interchange that many predict, it is necessary to start designing and adopting benchmarks allowing the c...
Stéphane Bressan, Gillian Dobbie, Zoé...
SSD
2001
Springer
162views Database» more  SSD 2001»
14 years 1 days ago
Interval Sequences: An Object-Relational Approach to Manage Spatial Data
The design of external index structures for one- and multidimensional extended objects is a long and well studied subject in basic database research. Today, more and more commercia...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
UIST
2000
ACM
13 years 12 months ago
Dynamic space management for user interfaces
We present a general approach to the dynamic representation of 2D space that is well suited for userinterface layout. We partition space into two distinct categories: full and emp...
Blaine Bell, Steven Feiner
VLDB
1997
ACM
170views Database» more  VLDB 1997»
13 years 11 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula