Sciweavers

1018 search results - page 97 / 204
» On the minimization of XPath queries
Sort
View
DEBU
1999
112views more  DEBU 1999»
15 years 1 months ago
Describing and Manipulating XML Data
This paper presents a brief overview of data management using the Extensible Markup Language (XML). It presents the basics of XML and the DTDs used to constrain XML data, and desc...
Sudarshan S. Chawathe
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
15 years 8 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
LOCA
2009
Springer
15 years 8 months ago
Location Diversity: Enhanced Privacy Protection in Location Based Services
Abstract. Location-based Services are emerging as popular applications in pervasive computing. Spatial k-anonymity is used in Locationbased Services to protect privacy, by hiding t...
Mingqiang Xue, Panos Kalnis, Hung Keng Pung
ICDE
2009
IEEE
158views Database» more  ICDE 2009»
16 years 3 months ago
KSpot: Effectively Monitoring the K Most Important Events in a Wireless Sensor Network
This demo presents a graphical user interface and ranking system, coined KSpot, for effectively monitoring the K highest-ranked answers to a query Q in a Wireless Sensor Network. K...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, M...
VLDB
2002
ACM
157views Database» more  VLDB 2002»
16 years 1 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu