Sciweavers

102 search results - page 10 / 21
» Data Structures for Reporting Extension Violations in a Quer...
Sort
View
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
13 years 12 months ago
Closest Pair Queries in Spatial Databases
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
GIS
2007
ACM
14 years 8 months ago
TS2-tree - an efficient similarity based organization for trajectory data
The increasingly popular GPS technology and the growing amount of trajectory data it generates create the need for developing applications that efficiently store and query traject...
Petko Bakalov, Eamonn J. Keogh, Vassilis J. Tsotra...
ICC
2007
IEEE
116views Communications» more  ICC 2007»
14 years 1 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...
ICDE
2006
IEEE
112views Database» more  ICDE 2006»
14 years 8 months ago
XSEED: Accurate and Fast Cardinality Estimation for XPath Queries
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...
Ashraf Aboulnaga, Ihab F. Ilyas, M. Tamer Özs...
CIKM
2008
Springer
13 years 9 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...