Sciweavers

958 search results - page 97 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
88
Voted
DASFAA
2006
IEEE
135views Database» more  DASFAA 2006»
15 years 1 months ago
An Efficient Co-operative Framework for Multi-query Processing over Compressed XML Data
XML is a de-facto standard for exchanging and presenting information on the Web. However, XML data is also recognized as verbose since it heavily inflates the size of the data due ...
Juzhen He, Wilfred Ng, Xiaoling Wang, Aoying Zhou
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
15 years 10 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
15 years 11 months ago
SQL Queries Over Unstructured Text Databases
Text documents often embed data that is structured in nature. By processing a text database with information extraction systems, we can define a variety of structured "relati...
Alpa Jain, AnHai Doan, Luis Gravano
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
14 years 8 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
15 years 1 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong