咨询与建议

限定检索结果

文献类型

  • 35 篇 期刊文献
  • 19 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 55 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 49 篇 工学
    • 45 篇 计算机科学与技术...
    • 15 篇 软件工程
    • 8 篇 电气工程
    • 7 篇 信息与通信工程
    • 4 篇 生物工程
    • 3 篇 控制科学与工程
    • 2 篇 电子科学与技术(可...
    • 1 篇 仪器科学与技术
    • 1 篇 生物医学工程(可授...
    • 1 篇 网络空间安全
  • 15 篇 理学
    • 12 篇 数学
    • 3 篇 生物学
    • 2 篇 系统科学
  • 4 篇 医学
    • 1 篇 公共卫生与预防医...
  • 2 篇 管理学
    • 1 篇 管理科学与工程(可...
    • 1 篇 公共管理
    • 1 篇 图书情报与档案管...
  • 1 篇 哲学
  • 1 篇 文学

主题

  • 55 篇 conjunctive quer...
  • 5 篇 query optimizati...
  • 4 篇 description logi...
  • 4 篇 theory
  • 3 篇 knowledge base
  • 3 篇 computational co...
  • 3 篇 relational datab...
  • 3 篇 tableau
  • 3 篇 np-complete
  • 3 篇 treewidth
  • 3 篇 query containmen...
  • 2 篇 data integration...
  • 2 篇 equivalence
  • 2 篇 query processing
  • 2 篇 data integration
  • 2 篇 query plan
  • 2 篇 hypergraph
  • 2 篇 algorithms
  • 2 篇 equivalence of q...
  • 2 篇 bloom filter

机构

  • 3 篇 hasselt univ has...
  • 2 篇 georgia state un...
  • 2 篇 harbin inst tech...
  • 2 篇 transnat univ li...
  • 2 篇 univ politecn ca...
  • 2 篇 university of wa...
  • 2 篇 univ london dept...
  • 2 篇 hong kong baptis...
  • 2 篇 xidian univ sch ...
  • 2 篇 univ new brunswi...
  • 2 篇 free univ bozen ...
  • 1 篇 nanjing normal u...
  • 1 篇 univ psl di ens ...
  • 1 篇 univ waterloo wa...
  • 1 篇 univ amsterdam
  • 1 篇 university of ma...
  • 1 篇 wright state uni...
  • 1 篇 univ bremen fach...
  • 1 篇 univ milano bico...
  • 1 篇 univ pompeu fabr...

作者

  • 4 篇 qichen wang
  • 3 篇 lu rongxing
  • 3 篇 zakharyaschev mi...
  • 3 篇 gottlob georg
  • 3 篇 fujita satoshi
  • 2 篇 kolaitis phokion...
  • 2 篇 tagashira shigea...
  • 2 篇 schwentick thoma...
  • 2 篇 suciu dan
  • 2 篇 van den bussche ...
  • 2 篇 navas-delgado is...
  • 2 篇 xiao hu
  • 2 篇 botoeva elena
  • 2 篇 aldana-montes jo...
  • 2 篇 wolter frank
  • 2 篇 kontchakov roman
  • 2 篇 sagiv y
  • 2 篇 cai zhipeng
  • 2 篇 atserias albert
  • 2 篇 ryzhikov vladisl...

语言

  • 54 篇 英文
  • 1 篇 其他
检索条件"主题词=Conjunctive query"
55 条 记 录,以下是1-10 订阅
排序:
Forward Private Verifiable Dynamic Searchable Symmetric Encryption With Efficient conjunctive query
收藏 引用
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2024年 第2期21卷 746-763页
作者: Guo, Cheng Li, Wenfeng Tang, Xinyu Choo, Kim-Kwang Raymond Liu, Yining Dalian Univ Technol Key Lab Ubiquitous Network & Serv Software Liaonin Dalian 116620 Liaoning Peoples R China Dalian Univ Technol Sch Software Technol Dalian 116620 Liaoning Peoples R China Guilin Univ Elect Technol Guangxi Key Lab Trusted Software Guilin 541004 Guangxi Peoples R China Univ Texas San Antonio Dept Informat Syst & Cyber Secur San Antonio TX 78249 USA Univ Texas San Antonio Dept Elect & Comp Engn San Antonio TX 78249 USA
Dynamic searchable symmetric encryption (DSSE) allows efficient searches over encrypted databases and also supports clients in their updating of the data, such as those stored in a remote cloud server. However, recent... 详细信息
来源: 评论
Achieving Efficient and Privacy-Preserving Multi-Keyword conjunctive query Over Cloud
收藏 引用
IEEE ACCESS 2019年 7卷 165862-165872页
作者: Yin, Fan Zheng, Yandong Lu, Rongxing Tang, Xiaohu Southwest Jiaotong Univ Informat Secur & Natl Comp Grid Lab Chengdu 611756 Peoples R China Univ New Brunswick Fac Comp Sci Fredericton NB E3B 5A3 Canada
With the explosive growth of data, it has become increasingly popular to deploy the powerful cloud to manage data. Meanwhile, as the cloud is not always fully trusted, personal and sensitive data have to be encrypted ... 详细信息
来源: 评论
Verifiable Searchable Symmetric Encryption Over Additive Homomorphism
收藏 引用
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2025年 20卷 1320-1332页
作者: Ji, Licheng Li, Jiguo Zhang, Yicheng Lu, Yang Fujian Normal Univ Coll Comp & Cyber Secur Fuzhou 350117 Peoples R China Minist Educ Sch Math & Stat Fuzhou 350117 Fujian Peoples R China Minist Educ Key Lab Analyt Math & Applicat Fuzhou 350117 Fujian Peoples R China Fujian Prov Key Lab Network Secur & Cryptol Fuzhou 350117 Peoples R China Nanjing Normal Univ Sch Comp Sci & Technol Nanjing 210023 Peoples R China
Searchable symmetric encryption (SSE) allows the client to search encrypted documents on an untrusted server without revealing the document content and queried keywords. To improve search efficiency and enrich express... 详细信息
来源: 评论
Owner-free Distributed Symmetric Searchable Encryption Supporting conjunctive Queries
收藏 引用
ACM TRANSACTIONS ON STORAGE 2023年 第4期19卷 1-25页
作者: Tong, Qiuyun Li, Xinghua Miao, Yinbin Wang, Yunwei Liu, Ximeng Deng, Robert H. Xidian Univ Sch Cyber Engn Xian 710071 Peoples R China Minist Educ Engn Res Ctr Big Data Secur Xian 710071 Peoples R China Fuzhou Univ Coll Comp & Data Sci Fuzhou 350108 Peoples R China Singapore Management Univ Sch Informat Syst Singapore 188065 Singapore
Symmetric Searchable Encryption (SSE), as an ideal primitive, can ensure data privacy while supporting retrieval over encrypted data. However, existing multi-user SSE schemes require the data owner to share the secret... 详细信息
来源: 评论
When Do Homomorphism Counts Help in query Algorithms?  27
When Do Homomorphism Counts Help in Query Algorithms?
收藏 引用
27th International Conference on Database Theory (ICDT)
作者: ten Cate, Balder Dalmau, Victor Kolaitis, Phokion G. Wu, Wei-Lin Univ Amsterdam Amsterdam Netherlands Univ Pompeu Fabra Barcelona Spain Univ Calif Santa Cruz Santa Cruz CA 95064 USA IBM Almaden Res Ctr San Jose CA 95120 USA
A query algorithm based on homomorphism counts is a procedure for determining whether a given instance satisfies a property by counting homomorphisms between the given instance and finitely many predetermined instance... 详细信息
来源: 评论
Practical Non-interactive Encrypted conjunctive Search with Leakage Suppression  24
Practical Non-interactive Encrypted Conjunctive Search with ...
收藏 引用
31st Conference on Computer and Communications Security
作者: Wang, Yunling Sun, Shi-Feng Wang, Jianfeng Chen, Xiaofeng Liu, Joseph K. Gu, Dawu Xian Univ Posts & Telecommun Sch Cyberspace Secur Xian Peoples R China Shanghai Jiao Tong Univ Shanghai Peoples R China Blockchain Adv Res Ctr Wuxi Jiangsu Peoples R China Xidian Univ Sch Cyber Engn Xian Peoples R China Monash Univ Fac Informat Technol Melbourne Vic Australia
Encrypted conjunctive search enables server to perform efficient conjunctive query over encrypted data while guaranteeing data and query privacy. The well-known Oblivious Cross-Tags (OXT) protocol (by Cash et al. in C... 详细信息
来源: 评论
Finding Smallest Witnesses for conjunctive Queries  27
Finding Smallest Witnesses for Conjunctive Queries
收藏 引用
27th International Conference on Database Theory (ICDT)
作者: Hu, Xiao Sintos, Stavros Univ Waterloo Waterloo ON Canada Univ Illinois Chicago IL USA
A witness is a sub-database that preserves the query results of the original database but of much smaller size. It has wide applications in query rewriting and debugging, query explanation, IoT analytics, multi-layer ... 详细信息
来源: 评论
Achieve Efficient and Verifiable conjunctive and Fuzzy Queries over Encrypted Data in Cloud
收藏 引用
IEEE TRANSACTIONS ON SERVICES COMPUTING 2022年 第1期15卷 124-137页
作者: Shao, Jun Lu, Rongxing Guan, Yunguo Wei, Guiyi Zhejiang Gongshang Univ Dept Informat Secur Hangzhou 310018 Peoples R China Univ New Brunswick Fac Comp Sci Fredericton NB E3B 5A3 Canada
Due to the high demands of searchability over encrypted data, searchable encryption (SE) has recently received considerable attention and been widely suggested in encrypted cloud storage. Typically, the cloud server i... 详细信息
来源: 评论
Applications of Information Inequalities to Database Theory Problems  38
Applications of Information Inequalities to Database Theory ...
收藏 引用
38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
作者: Suciu, Dan Univ Washington Paul G Allen Sch Comp Sci & Engn Seattle WA 98195 USA
The paper describes several applications of information inequalities to problems in database theory. The problems discussed include: upper bounds of a query's output, worst-case optimal join algorithms, the query ... 详细信息
来源: 评论
conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis  23
Conjunctive Queries With Self-Joins, Towards a Fine-Grained ...
收藏 引用
42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS)
作者: Carmeli, Nofar Segoufin, Luc Univ PSL DI ENS ENS CNRSInria Paris France ENS Paris INRIA PSL Paris France
Even though query evaluation is a fundamental task in databases, known classifications of conjunctive queries by their fine-grained complexity only apply to queries without self-joins. We study how self-joins affect e... 详细信息
来源: 评论