Sciweavers

707 search results - page 17 / 142
» Processing queries on tree-structured data efficiently
Sort
View
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
14 years 8 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
ICDCS
2007
IEEE
14 years 14 days ago
Efficient Execution of Continuous Incoherency Bounded Queries over Multi-Source Streaming Data
On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically...
Manish Bhide, Krithi Ramamritham, Mukund Agrawal
VLDB
2002
ACM
101views Database» more  VLDB 2002»
14 years 8 months ago
Efficient similarity search for market basket data
Several organizations have developed very large market basket databases for the maintenance of customer transactions. New applications, e.g., Web recommendation systems, present th...
Alexandros Nanopoulos, Yannis Manolopoulos
EDBTW
2006
Springer
14 years 8 days ago
Hash-Based Structural Join Algorithms
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
Christian Mathis, Theo Härder
IJWIS
2008
110views more  IJWIS 2008»
13 years 8 months ago
Determined: a system with novel techniques for XML query optimization and evaluation
: Purpose -- Efficient processing of XML queries is critical for XML data management and related applications. Previously proposed techniques are unsatisfactory. This article prese...
Dunren Che, Wen-Chi Hou