Sciweavers

Share
ACSC
2001
IEEE
9 years 5 months ago
Optimised Phrase Querying and Browsing of Large Text Databases
Most search systems for querying large document collections---for example, web search engines---are based on well-understood information retrieval principles
Dirk Bahle, Hugh E. Williams, Justin Zobel
PDIS
1996
IEEE
9 years 5 months ago
Scrambling Query Plans to Cope With Unexpected Delays
Accessing data from numerous widely-distributed sources poses signi cant new challenges for query optimization and execution. Congestion and failures in the network can introduce ...
Laurent Amsaleg, Michael J. Franklin, Anthony Toma...
APWEB
2010
Springer
9 years 6 months ago
Optimizing Query Processing for the Hidden Web
Abstract. The term Deep Web (sometimes also called Hidden Web) refers to the data content that is created dynamically as the result of a speciļ¬c search on the Web. In this respec...
Andrea Calì, Davide Martinenghi
ICDT
2007
ACM
105views Database» more  ICDT 2007»
9 years 7 months ago
Optimization of Query Plans in the presence of Access Limitations
We consider the problem of querying data sources that have limited capabilities and can thus only be accessed by complying with certain binding patterns for their attributes. This ...
Andrea Calì, Diego Calvanese, Davide Martin...
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
9 years 7 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
10 years 2 months ago
Querying Data under Access Limitations
Data sources on the web are often accessible through web interfaces that present them as relational tables, but require certain attributes to be mandatorily selected, e.g., via a w...
Andrea Calì, Davide Martinenghi
books