Sciweavers

1042 search results - page 143 / 209
» Constraint Databases, Data Structures and Efficient Query Ev...
Sort
View
138
Voted
VLDB
1997
ACM
170views Database» more  VLDB 1997»
15 years 6 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
136
Voted
EDBT
2004
ACM
145views Database» more  EDBT 2004»
16 years 2 months ago
CUBE File: A File Structure for Hierarchically Clustered OLAP Cubes
Abstract. Hierarchical clustering has been proved an effective means for physically organizing large fact tables since it reduces significantly the I/O cost during ad hoc OLAP quer...
Nikos Karayannidis, Timos K. Sellis, Yannis Kouvar...
115
Voted
EDBT
2009
ACM
124views Database» more  EDBT 2009»
15 years 9 months ago
A sequential indexing scheme for flash-based embedded systems
NAND Flash has become the most popular stable storage medium for embedded systems. As on-board storage capacity increases, the need for efficient indexing techniques arises. Such ...
Shaoyi Yin, Philippe Pucheral, Xiaofeng Meng
141
Voted
DASFAA
2004
IEEE
156views Database» more  DASFAA 2004»
15 years 6 months ago
Automatic Generation of SQLX View Definitions from ORA-SS Views
Abstract. Although XML is the dominant standard for publishing and exchanging data for Internet-based business applications, data is typically stored in relational or object-relati...
Ya Bing Chen, Tok Wang Ling, Mong-Li Lee
121
Voted
EDBT
2004
ACM
187views Database» more  EDBT 2004»
16 years 2 months ago
Hierarchical In-Network Data Aggregation with Quality Guarantees
Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor netwo...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...