Sciweavers

2001 search results - page 64 / 401
» Indexing in a Hypertext Database
Sort
View
CIKM
2009
Springer
14 years 3 months ago
Maximal metric margin partitioning for similarity search indexes
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
BTW
2007
Springer
121views Database» more  BTW 2007»
14 years 3 months ago
Algorithms for merged indexes
B-tree and index into two layers of abstraction. In addition, this paper provides algorithms for (i) concurrency control and recovery including locking of individual keys and of co...
Goetz Graefe
SIGMOD
2003
ACM
163views Database» more  SIGMOD 2003»
14 years 9 months ago
Multi-Dimensional Clustering: A New Data Layout Scheme in DB2
We describe the design and implementation of a new data layout scheme, called multi-dimensional clustering, in DB2 Universal Database Version 8. Many applications, e.g., OLAP and ...
Sriram Padmanabhan, Bishwaranjan Bhattacharjee, Ti...
ICDE
2006
IEEE
146views Database» more  ICDE 2006»
14 years 10 months ago
Using XML to Build Efficient Transaction-Time Temporal Database Systems on Relational Databases
In this paper, we present the ArchIS system that achieves full-functionality transaction-time databases without requiring temporal extensions in XML or database standards. ArchIS&...
Fusheng Wang, Xin Zhou, Carlo Zaniolo
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
14 years 1 months ago
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amb...