Sciweavers

223 search results - page 39 / 45
» Expressive and Efficient Peer-to-Peer Queries
Sort
View
102
Voted
CIKM
1993
Springer
15 years 2 months ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe
72
Voted
VLDB
1989
ACM
114views Database» more  VLDB 1989»
15 years 2 months ago
Extending the Relational Algebra to Capture Complex Objects
An important direction in database research for non-standard applications (e.g. engineering or design applications) deals with adequate support for complex objects. Without doubt,...
Bernhard Mitschang
118
Voted
TDM
2004
203views Database» more  TDM 2004»
14 years 11 months ago
Relational Algebra: Mother Tongue - XQuery: Fluent
This work may be seen as a further proof of the versatility of the relational database model. Here, we add XQuery to the catalog of languages which RDBMSs are able to "speak&...
Torsten Grust, Jens Teubner
LREC
2008
90views Education» more  LREC 2008»
14 years 11 months ago
Navigating through Dense Annotation Spaces
Pattern matching, or querying, over annotations is a general purpose paradigm for inspecting, navigating, mining, and transforming annotation repositories--the common representati...
Branimir Boguraev, Mary S. Neff
76
Voted
INFSOF
2006
117views more  INFSOF 2006»
14 years 10 months ago
A high concurrency XPath-based locking protocol for XML databases
Providing efficient access to XML documents becomes crucial in XML database systems. More and more concurrency control protocols for XML database systems were proposed in the past...
Kuen-Fang Jack Jea, Shih-Ying Chen