Sciweavers

389 search results - page 18 / 78
» A skip-list approach for efficiently processing forecasting ...
Sort
View
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...
VLDB
1995
ACM
97views Database» more  VLDB 1995»
13 years 11 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
RR
2007
Springer
14 years 1 months ago
Efficiently Querying Relational Databases Using OWL and SWRL
For the foreseeable future, most data will continue to be stored in relational databases. To work with these data in ontology-based applications, tools and techniques that bridge t...
Martin J. O'Connor, Ravi Shankar, Samson W. Tu, Cs...
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
14 years 9 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...
EDBT
1998
ACM
131views Database» more  EDBT 1998»
13 years 11 months ago
Processing Complex Similarity Queries with Distance-Based Access Methods
Efficient evaluation of similarity queries is one of the basic requirements for advanced multimedia applications. In this paper, we consider the relevant case where complex similar...
Paolo Ciaccia, Marco Patella, Pavel Zezula