Sciweavers

1042 search results - page 88 / 209
» Constraint Databases, Data Structures and Efficient Query Ev...
Sort
View
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
14 years 9 months ago
Space-Efficient Online Computation of Quantile Summaries
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
Michael Greenwald, Sanjeev Khanna
CPM
2006
Springer
125views Combinatorics» more  CPM 2006»
14 years 24 days ago
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
Tetsuo Shibuya
DASFAA
2006
IEEE
135views Database» more  DASFAA 2006»
14 years 22 days ago
An Efficient Co-operative Framework for Multi-query Processing over Compressed XML Data
XML is a de-facto standard for exchanging and presenting information on the Web. However, XML data is also recognized as verbose since it heavily inflates the size of the data due ...
Juzhen He, Wilfred Ng, Xiaoling Wang, Aoying Zhou
CIKM
2010
Springer
13 years 7 months ago
Automatic schema merging using mapping constraints among incomplete sources
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
Xiang Li 0002, Christoph Quix, David Kensche, Sand...
ICDE
2007
IEEE
178views Database» more  ICDE 2007»
14 years 10 months ago
Efficient Skyline Query Processing on Peer-to-Peer Networks
Skyline query has been gaining much interest in database research communities in recent years. Most existing studies focus mainly on centralized systems, and resolving the problem...
Shiyuan Wang, Beng Chin Ooi, Anthony K. H. Tung, L...