Sciweavers

6905 search results - page 138 / 1381
» Querying Multidimensional Databases
Sort
View
DASFAA
2004
IEEE
102views Database» more  DASFAA 2004»
15 years 4 months ago
Efficient Declustering of Non-uniform Multidimensional Data Using Shifted Hilbert Curves
Abstract. Data declustering speeds up large data set retrieval by partitioning the data across multiple disks or sites and performing retrievals in parallel. Performance is determi...
Hak-Cheol Kim, Mario A. Lopez, Scott T. Leutenegge...
133
Voted
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
14 years 3 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
103
Voted
DASFAA
2008
IEEE
109views Database» more  DASFAA 2008»
15 years 7 months ago
Supporting Keyword Queries on Structured Databases with Limited Search Interfaces
Many Web sources provide forms to allow users to query their hidden data. For instance, online stores such as Amazon.com have search interfaces, using which users can query informa...
Nurcan Yuruk, Xiaowei Xu, Chen Li, Jeffrey Xu Yu
114
Voted
SSD
2001
Springer
111views Database» more  SSD 2001»
15 years 5 months ago
Querying Mobile Objects in Spatio-Temporal Databases
In dynamic spatio-temporal environments where objects may continuously move in space, maintaining consistent information about the location of objects and processing motion-speciï¬...
Kriengkrai Porkaew, Iosif Lazaridis, Sharad Mehrot...
100
Voted
ADBIS
1998
Springer
100views Database» more  ADBIS 1998»
15 years 5 months ago
Multiple Range Query Optimization in Spatial Databases
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
Apostolos Papadopoulos, Yannis Manolopoulos