Sciweavers

1888 search results - page 199 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
16 years 4 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
315
Voted
CIDR
2011
401views Algorithms» more  CIDR 2011»
14 years 7 months ago
DBease: Making Databases User-Friendly and Easily Accessible
Structured query language (SQL) is a classical way to access relational databases. Although SQL is powerful to query relational databases, it is rather hard for inexperienced user...
Guoliang Li, Ju Fan, Hao Wu, Jiannan Wang, Jianhua...
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 10 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
ICDE
2005
IEEE
106views Database» more  ICDE 2005»
15 years 9 months ago
Reconstructing XML Subtrees from Relational Storage of XML documents
Numerous researchers have proposed to use relational databases to store and query XML documents. One important component of such systems is the XML subtree reconstruction, which r...
Artem Chebotko, Dapeng Liu, Mustafa Atay, Shiyong ...
SSDBM
2003
IEEE
118views Database» more  SSDBM 2003»
15 years 9 months ago
A Practical Approach for Microscopy Imaging Data Management (MIDM) in Neuroscience
Current data management approaches can easily handle the relatively simple requirements for molecular biology research but not the more varied and sophisticated microscopy imaging...
Shenglan Zhang, Xufei Qian, Amarnath Gupta, Maryan...