Sciweavers

958 search results - page 49 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
DBISP2P
2006
Springer
195views Database» more  DBISP2P 2006»
15 years 4 months ago
XML Query Routing in Structured P2P Systems
Abstract. This paper addresses the problem of data placement, indexing, and querying large XML data repositories distributed over an existing P2P service infrastructure. Our archit...
Leonidas Fegaras, Weimin He, Gautam Das, David Lev...
116
Voted
SSDBM
2003
IEEE
95views Database» more  SSDBM 2003»
15 years 5 months ago
A Quad-Tree Based Multiresolution Approach for Two-dimensional Summary Data
In many application contexts, like statistical databases, scientific databases, query optimizers, OLAP, and so on, data are often summarized into synopses of aggregate values. Su...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
114
Voted
AAAI
2008
15 years 2 months ago
Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
Zhenglu Yang, Lin Li, Masaru Kitsuregawa
96
Voted
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 4 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
IPL
2002
59views more  IPL 2002»
15 years 5 days ago
An efficient decoding technique for Huffman codes
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular...
Rezaul Alam Chowdhury, M. Kaykobad, Irwin King