Sciweavers

301 search results - page 37 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
16 years 11 days ago
Approximately Processing Multi-granularity Aggregate Queries over Data Streams
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
Shouke Qin, Weining Qian, Aoying Zhou
173
Voted
SIGMOD
2007
ACM
162views Database» more  SIGMOD 2007»
15 years 11 months ago
Effective and efficient update of xml in RDBMS
Querying XML effectively and efficiently using declarative languages such as XQuery and XPath has been widely studied in both academic and industrial settings. Most RDBMS vendors ...
Zhen Hua Liu, Muralidhar Krishnaprasad, James W. W...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
15 years 11 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
SIGMOD
2003
ACM
1527views Database» more  SIGMOD 2003»
15 years 11 months ago
XPRESS: A Queriable Compression for XML Data
Like HTML, many XML documents are resident on native file systems. Since XML data is irregular and verbose, the disk space and the network bandwidth are wasted. To overcome the ve...
Jun-Ki Min, Myung-Jae Park, Chin-Wan Chung
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
15 years 12 days ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir