Sciweavers

2514 search results - page 210 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ICDE
2011
IEEE
232views Database» more  ICDE 2011»
14 years 10 months ago
XClean: Providing valid spelling suggestions for XML keyword queries
—An important facility to aid keyword search on XML data is suggesting alternative queries when user queries contain typographical errors. Query suggestion thus can improve users...
Yifei Lu, Wei Wang, Jianxin Li, Chengfei Liu
BXML
2004
15 years 8 months ago
Query Reformulation for the XML standards XPath, XQuery and XSLT
: Whenever transformation of data is used to bridge the gap of different data formats, and a query is given in the destination format, query reformulation can speed up the transfor...
Sven Groppe, Stefan Böttcher
DOLAP
2003
ACM
15 years 12 months ago
Exploiting hierarchical clustering in evaluating multidimensional aggregation queries
Multidimensional aggregation queries constitute the single most important class of queries for data warehousing applications and decision support systems. The bottleneck in the ev...
Dimitri Theodoratos
COMPGEOM
2010
ACM
15 years 11 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
OPODIS
2007
15 years 8 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...