Sciweavers

709 search results - page 63 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
WWW
2008
ACM
16 years 6 months ago
Efficiently finding web services using a clustering semantic approach
Efficiently finding Web services on the Web is a challenging issue in service-oriented computing. Currently, UDDI is a standard for publishing and discovery of Web services, and U...
Jiangang Ma, Yanchun Zhang, Jing He
CN
2010
136views more  CN 2010»
15 years 6 months ago
PCIR: Combining DHTs and peer clusters for efficient full-text P2P indexing
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
16 years 6 months ago
Efficient provenance storage
Scientific workflow systems are increasingly used to automate complex data analyses, largely due to their benefits over traditional approaches for workflow design, optimization, a...
Adriane Chapman, H. V. Jagadish, Prakash Ramanan
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
16 years 7 months ago
Representing and Querying Correlated Tuples in Probabilistic Databases
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of pr...
Prithviraj Sen, Amol Deshpande
CNL
2009
15 years 7 months ago
Controlled English Ontology-Based Data Access
Abstract. As it is well-known, querying and managing structured data in natural language is a challenging task due to its ambiguity (syntactic and semantic) and its expressiveness....
Camilo Thorne, Diego Calvanese