Sciweavers

58 search results - page 9 / 12
» Tradeoffs in XML Database Compression
Sort
View
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
12 years 9 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
ICDE
2004
IEEE
90views Database» more  ICDE 2004»
14 years 8 months ago
Multiresolution Indexing of XML for Frequent Queries
XML and other types of semi-structured data are typically represented by a labeled directed graph. To speed up path expression queries over the graph, a variety of structural inde...
Hao He, Jun Yang 0001
SIGMOD
2004
ACM
149views Database» more  SIGMOD 2004»
14 years 6 months ago
Incremental Maintenance of XML Structural Indexes
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
Ke Yi, Hao He, Ioana Stanoi, Jun Yang 0001
ADC
2003
Springer
182views Database» more  ADC 2003»
13 years 12 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
ACMSE
2005
ACM
14 years 8 days ago
On developing a simple in-house digital library archive
Digital libraries (DLs) have become a major focus of information technology resources for organizations from academia, to the US Department of Defense to the archeological efforts...
Eric L. Brown, Luis G. Velazco, G. Kirksey, S. Ram...