Sciweavers

721 search results - page 47 / 145
» Layered Index Structures in Document Database Systems
Sort
View
128
Voted
WWW
2005
ACM
16 years 4 months ago
XAR-miner: efficient association rules mining for XML data
In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently. In XAR-Miner, raw data in the XML document are first preprocessed to transf...
Sheng Zhang, Ji Zhang, Han Liu, Wei Wang
DKE
1998
88views more  DKE 1998»
15 years 3 months ago
Temporal Grid File: A File Structure for Interval Data
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
Chiang Lee, Te-Ming Tseng
DASFAA
1999
IEEE
84views Database» more  DASFAA 1999»
15 years 7 months ago
P-Tree: A B-Tree Index for Lists
The high frequency of applications involving large, ordered, nested lists suggests that list is the "next most" natural data type after set. A list differs from a set th...
Ke Wang, Beng Chin Ooi, Sam Yuan Sung
267
Voted
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
16 years 4 months ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain
216
Voted
ICDE
1999
IEEE
94views Database» more  ICDE 1999»
16 years 4 months ago
Scalable Trigger Processing
Current database trigger systems have extremely limited scalability. This paper proposes a way to develop a truly scalable trigger system. Scalability to large numbers of trigger...
Eric N. Hanson, Chris Carnes, Lan Huang, Mohan Kon...