Sciweavers

2635 search results - page 185 / 527
» Algorithms for the Database Layout Problem
Sort
View
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
16 years 8 months ago
Weighted Proximity Best-Joins for Information Retrieval
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
AnHai Doan, Haixun Wang, Hao He, Jun Yang 0001, Ri...
VLDB
2010
ACM
144views Database» more  VLDB 2010»
15 years 4 months ago
Methods for finding frequent items in data streams
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
Graham Cormode, Marios Hadjieleftheriou
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
16 years 7 months ago
Graph Structured Views and Their Incremental Maintenance
We study the problem of maintaining materialized views of graph structured data. The base data consists of records containing identi ers of other records. The data could represent...
Yue Zhuge, Hector Garcia-Molina
ADC
2009
Springer
132views Database» more  ADC 2009»
16 years 1 months ago
On Inference of XML Schema with the Knowledge of an Obsolete One
The XML has undoubtedly become a standard for data representation and manipulation. But most of XML documents are still created without the respective description of their structu...
Irena Mlynkova
ICDT
2007
ACM
148views Database» more  ICDT 2007»
16 years 20 days ago
Ask a Better Question, Get a Better Answer A New Approach to Private Data Analysis
Cryptographic techniques for reasoning about information leakage have recently been brought to bear on the classical problem of statistical disclosure control – revealing accurat...
Cynthia Dwork