Sciweavers

792 search results - page 38 / 159
» Computing Iceberg Queries Efficiently
Sort
View
ICDE
2001
IEEE
106views Database» more  ICDE 2001»
15 years 11 months ago
Querying XML Documents Made Easy: Nearest Concept Queries
Due to the ubiquity and popularity of XML, users often are in the following situation: they want to query XML documents which contain potentially interesting information but they ...
Albrecht Schmidt 0002, Martin L. Kersten, Menzo Wi...
SIGMOD
2004
ACM
148views Database» more  SIGMOD 2004»
15 years 10 months ago
Vertical and Horizontal Percentage Aggregations
Existing SQL aggregate functions present important limitations to compute percentages. This article proposes two SQL aggregate functions to compute percentages addressing such lim...
Carlos Ordonez
DCOSS
2007
Springer
15 years 1 months ago
Efficient and Distributed Access Control for Sensor Networks
Sensor networks are often used to sense the physical world and provide observations for various uses. In hostile environments, it is critical to control the network access to ensur...
Donggang Liu
TKDE
2002
127views more  TKDE 2002»
14 years 9 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
DASFAA
2007
IEEE
208views Database» more  DASFAA 2007»
15 years 4 months ago
Probabilistic Nearest-Neighbor Query on Uncertain Objects
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
Hans-Peter Kriegel, Peter Kunath, Matthias Renz