Sciweavers

1160 search results - page 115 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
16 years 3 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
ICDE
2009
IEEE
144views Database» more  ICDE 2009»
16 years 3 months ago
Reachability Indexes for Relational Keyword Search
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
Alexander Markowetz, Yin Yang, Dimitris Papadias
VLDB
2002
ACM
114views Database» more  VLDB 2002»
15 years 1 months ago
Tree Pattern Aggregation for Scalable XML Data Dissemination
With the rapid growth of XML-document traffic on the Internet, scalable content-based dissemination of XML documents to a large, dynamic group of consumers has become an important...
Chee Yong Chan, Wenfei Fan, Pascal Felber, Minos N...
SIGMOD
1999
ACM
107views Database» more  SIGMOD 1999»
15 years 5 months ago
Client-Site Query Extensions
We explore the execution of queries with client-site userdefined functions (UDFs). Many UDFs can only be executed at the client site, for reasons of scalability, security, confide...
Tobias Mayr, Praveen Seshadri
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
16 years 2 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...