Sciweavers

184 search results - page 20 / 37
» A new range query algorithm for Universal B-trees
Sort
View
PODS
2006
ACM
137views Database» more  PODS 2006»
15 years 12 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
15 years 12 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han
CIKM
2005
Springer
15 years 5 months ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
NCA
2008
IEEE
15 years 6 months ago
Sorting Based Data Centric Storage
— Data-centric storage [6] is a very important concept for sensor networks that supports efficient in-network data query and processing. Previous approaches are mostly using a h...
Fenghui Zhang, Anxiao Jiang, Jianer Chen
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
15 years 4 months ago
Interactive privacy via the median mechanism
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
Aaron Roth, Tim Roughgarden