Sciweavers

5221 search results - page 830 / 1045
» An On-line Problem Database
Sort
View
VLDB
2008
ACM
136views Database» more  VLDB 2008»
16 years 6 months ago
Efficient updates in dynamic XML data: from binary string to quaternary string
XML query processing based on labeling schemes has been thoroughly studied in the past several years. Recently efficient processing of updates in dynamic XML data has gained more a...
Changqing Li, Tok Wang Ling, Min Hu
VLDB
2009
ACM
147views Database» more  VLDB 2009»
16 years 6 months ago
Privacy-preserving indexing of documents on the network
We address the problem of providing privacypreserving search over distributed accesscontrolled content. Indexed documents can be easily reconstructed from conventional (inverted) ...
Mayank Bawa, Rakesh Agrawal, Roberto J. Bayardo Jr...
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
16 years 6 months ago
A gauss function based approach for unbalanced ontology matching
Ontology matching, aiming to obtain semantic correspondences between two ontologies, has played a key role in data exchange, data integration and metadata management. Among numero...
Qian Zhong, Hanyu Li, Juanzi Li, Guo Tong Xie, Jie...
SIGMOD
2008
ACM
123views Database» more  SIGMOD 2008»
16 years 6 months ago
Query-based partitioning of documents and indexes for information lifecycle management
Regulations require businesses to archive many electronic documents for extended periods of time. Given the sheer volume of documents and the response time requirements, documents...
Soumyadeb Mitra, Marianne Winslett, Windsor W. Hsu
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
16 years 6 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng