Sciweavers

552 search results - page 31 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
15 years 12 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
ICDE
2007
IEEE
218views Database» more  ICDE 2007»
16 years 1 months ago
SKYPEER: Efficient Subspace Skyline Computation over Distributed Data
Skyline query processing has received considerable attention in the recent past. Mainly, the skyline query is used to find a set of non dominated data points in a multidimensional...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
DMSN
2006
ACM
15 years 3 months ago
Processing proximity queries in sensor networks
Sensor networks are often used to perform monitoring tasks, such as in animal or vehicle tracking and in surveillance of enemy forces in military applications. In this paper we in...
Yannis Kotidis
ICDT
2009
ACM
109views Database» more  ICDT 2009»
16 years 14 days ago
TOP-K projection queries for probabilistic business processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specific...
Daniel Deutch, Tova Milo
VLDB
2002
ACM
98views Database» more  VLDB 2002»
14 years 11 months ago
Processing Star Queries on Hierarchically-Clustered Fact Tables
Star queries are the most prevalent kind of queries in data warehousing, OLAP and business intelligence applications. Thus, there is an imperative need for efficiently processing ...
Nikos Karayannidis, Aris Tsois, Timos K. Sellis, R...