QIDO-RS - Search
6.7.1 QIDO-RS - Search
The specific resources to be used for the search actions shall be as follows:
-
-
Each {attributeID} must refer to one of:
-
Series IE attributes (SearchForSeries or SearchForInstances requests only)
-
Composite Instance IE attributes (SearchForInstances requests only)
-
Additional Query/Retrieve Attributes (Section C.3.4 in PS3.4 )
See Section 6.7.1.1.1 for {attributeID} and {value} encoding rules
-
The “limit” parameter value is an unsigned integer, which specifies the maximum number of results the origin server shall return. If the “limit” parameter is not present the origin server shall return the maximum number of results in a single response that it supports.
-
The “offset” parameter value is an unsigned integer, which specifies the number of results the origin server shall skip before the first returned result. If the “offset” query parameter is not present, its value is 0
..../dcm4chee-arc/aets/DCM4CHEE/rs/studies/count?returnempty=false&PatientName=t&fuzzymatching=true&compressionfailed=false
..../dcm4chee-arc/aets/DCM4CHEE/rs/studies?returnempty=false&PatientName=t&fuzzymatching=true&compressionfailed=false
..../dcm4chee-arc/aets/DCM4CHEE/rs/studies?includefield=all&offset=0&limit=21&orderby=-StudyDate,-StudyTime&returnempty=false&PatientName=t&fuzzymatching=true&compressionfailed=false
相关文章
- Lintcode: Search Range in Binary Search Tree
- Leetcode: Word Search
- Leetcode Validate Binary Search Tree
- Module database cache not built yet, using slow search
- php利用array_search与array_column实现二维数组查找
- leetcode 二分查找 Search in Rotated Sorted Array
- 第四十一章 构建数据库应用程序 - 带有CSP Search标签的CSP搜索页面
- 23 爬虫 - re 正则 search 方法
- [geeksforgeeks] Lowest Common Ancestor in a Binary Search Tree.
- [LeetCode] Unique Binary Search Trees II
- 【LeetCode】235. Lowest Common Ancestor of a Binary Search Tree (2 solutions)
- 【LeetCode】81. Search in Rotated Sorted Array II (2 solutions)
- 【LeetCode】74. Search a 2D Matrix
- 【LeetCode】79. Word Search
- leetcode笔记:Search in Rotated Sorted Array
- odoo search 查询时排序反顺序
- [LeetCode] 1008. Construct Binary Search Tree from Preorder Traversal 从先序遍历重建二叉搜索树