Sciweavers

184 search results - page 13 / 37
» A new range query algorithm for Universal B-trees
Sort
View
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
15 years 12 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
JACM
2000
81views more  JACM 2000»
14 years 11 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
ADBIS
2010
Springer
145views Database» more  ADBIS 2010»
15 years 1 months ago
On Support of Ordering in Multidimensional Data Structures
Multidimensional data structures are applied in many areas, e.g. in data mining, indexing multimedia data and text documents, and so on. There are some applications where the range...
Filip Krizka, Michal Krátký, Radim B...
GIS
2005
ACM
16 years 24 days ago
Close pair queries in moving object databases
Databases of moving objects are important for air traffic control, ground traffic, and battlefield configurations. We introduce the (historical and spatial) range close-pair query...
Panfeng Zhou, Donghui Zhang, Betty Salzberg, Gene ...
DOLAP
2003
ACM
15 years 5 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