Sciweavers

1007 search results - page 107 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
178
Voted
ICDE
2009
IEEE
157views Database» more  ICDE 2009»
15 years 14 days ago
Query Rewrites with Views for XML in DB2
There is much effort to develop comprehensive support for the storage and querying of XML data in database management systems. The major developers have extended their systems to h...
Parke Godfrey, Jarek Gryz, Andrzej Hoppe, Wenbin M...
247
Voted
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 3 months ago
Keyword search on structured and semi-structured data
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
Yi Chen, Wei Wang 0011, Ziyang Liu, Xuemin Lin
113
Voted
CORR
2011
Springer
148views Education» more  CORR 2011»
14 years 9 months ago
On Social-Temporal Group Query with Acquaintance Constraint
Three essential criteria are important for activity planning, including: (1) finding a group of attendees familiar with the initiator, (2) ensuring each attendee in the group to ...
De-Nian Yang, Yi-Ling Chen, Wang-Chien Lee, Ming-S...
116
Voted
VLDB
2004
ACM
96views Database» more  VLDB 2004»
15 years 8 months ago
Answering XPath Queries over Networks by Sending Minimal Views
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may...
Keishi Tajima, Yoshiki Fukui
126
Voted
DKE
2006
123views more  DKE 2006»
15 years 2 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...